Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis

Turbo-charging is a recent algorithmic technique that is based on the fixed-parameter tractability of the dynamic versions of some problems as a way to improve heuristics. We demonstrate the effectiveness of this technique and develop the turbo-charging idea further. A new hybrid heuristic for the Dominating Set problem that further improves this method is obtained by combining the turbo-charging technique with other standard heuristic tools including Local Search (LS). We implement both the recently proposed “turbo greedy” algorithm of Downey et al. [8] and a new method presented in this paper. The performance of these new heuristics is assessed on three suites of benchmark datasets, namely DIMACS, BHOSLIB and KONECT. Experiments comparing our algorithm to both heuristic and exact algorithms demonstrate its effectiveness. Our algorithm often produced results that were either exact or better than all the other available algorithms.

[1]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[2]  David Steurer,et al.  Analytical approach to parallel repetition , 2013, STOC.

[3]  Rolf Niedermeier,et al.  Polynomial-time data reduction for dominating set , 2002, JACM.

[4]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[5]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[6]  David Peleg,et al.  Distributed Data Structures: A Complexity-Oriented View , 1991, WDAG.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Judit Bar-Ilan,et al.  How to Allocate Network Centers , 1993, J. Algorithms.

[9]  Saket Saurabh,et al.  Don't Be Strict in Local Search! , 2012, AAAI.

[10]  Frances A. Rosamond,et al.  Dynamic Dominating Set and Turbo-Charging Greedy Heuristics , 2014 .

[11]  Laura A. Sanchis,et al.  Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem , 2002, Algorithmica.

[12]  Fabrizio Grandoni,et al.  Measure and Conquer: Domination - A Case Study , 2005, ICALP.

[13]  Abhay Parekh,et al.  Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs , 1991, Inf. Process. Lett..

[14]  Ralph Wittmann Multicast Communication: Protocols, Programming and Applications , 2000 .

[15]  Francis C. M. Lau,et al.  Set multi-covering via inclusion-exclusion , 2009, Theor. Comput. Sci..

[16]  Amer E. Mouawad,et al.  A Hybrid Graph Representation for Recursive Backtracking Algorithms , 2010, FAW.

[17]  Eli Upfal,et al.  A trade-off between space and efficiency for routing tables , 1989, JACM.

[18]  Michael R. Fellows,et al.  On complexity of lobbying in multiple referenda , 2006 .

[19]  Mauricio G. C. Resende,et al.  A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..

[20]  Sebastian Böcker,et al.  Exact Algorithms for Cluster Editing: Evaluation and Experiments , 2008, Algorithmica.

[21]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.