License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SEA.2018.13
URN: urn:nbn:de:0030-drops-89484
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8948/
Go to the corresponding LIPIcs Volume Portal

Haraguchi, Kazuya

An Efficient Local Search for the Minimum Independent Dominating Set Problem

pdf-format:
LIPIcs-SEA-2018-13.pdf (0.5 MB)

Abstract

In the present paper, we propose an efficient local search for the minimum independent dominating set problem. We consider a local search that uses k-swap as the neighborhood operation. Given a feasible solution S, it is the operation of obtaining another feasible solution by dropping exactly k vertices from S and then by adding any number of vertices to it. We show that, when k=2, (resp., k=3 and a given solution is minimal with respect to 2-swap), we can find an improved solution in the neighborhood or conclude that no such solution exists in O(n Delta) (resp., O(n Delta^3)) time, where n denotes the number of vertices and Delta denotes the maximum degree. We develop a metaheuristic algorithm that repeats the proposed local search and the plateau search iteratively, where the plateau search examines solutions of the same size as the current solution that are obtainable by exchanging a solution vertex and a non-solution vertex. The algorithm is so effective that, among 80 DIMACS graphs, it updates the best-known solution size for five graphs and performs as well as existing methods for the remaining graphs.

BibTeX - Entry

@InProceedings{haraguchi:LIPIcs:2018:8948,
  author =	{Kazuya Haraguchi},
  title =	{{An Efficient Local Search for the Minimum Independent Dominating Set Problem}},
  booktitle =	{17th International Symposium on Experimental Algorithms  (SEA 2018)},
  pages =	{13:1--13:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-070-5},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{103},
  editor =	{Gianlorenzo D'Angelo},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8948},
  URN =		{urn:nbn:de:0030-drops-89484},
  doi =		{10.4230/LIPIcs.SEA.2018.13},
  annote =	{Keywords: Minimum independent dominating set problem, local search, plateau search, metaheuristics}
}

Keywords: Minimum independent dominating set problem, local search, plateau search, metaheuristics
Collection: 17th International Symposium on Experimental Algorithms (SEA 2018)
Issue Date: 2018
Date of publication: 19.06.2018
Supplementary Material: The source code of the proposed algorithm is written in C++ and available at http://puzzle.haraguchi-s.otaru-uc.ac.jp/minids/.

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI