Polynomial Time Data Reduction for Dominating Set
Abstract
Dealing with the NP-complete Dominating Set problem on undirected graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In particular, we prove that Dominating Set restricted to planar graphs has a so-called problem kernel of linear size, achieved by two simple and easy to implement reduction rules. Moreover, having implemented our reduction rules, first experiments indicate the impressive practical potential of these rules. Thus, this work seems to open up a new and prospective way how to cope with one of the most important problems in graph theory and combinatorial optimization.
Cite
@article{arxiv.cs/0207066,
title = {Polynomial Time Data Reduction for Dominating Set},
author = {Jochen Alber and Michael R. Fellows and Rolf Niedermeier},
journal= {arXiv preprint arXiv:cs/0207066},
year = {2007}
}
Comments
25 pages, 4 figures (using 8 files), extended abstract entitled "Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case" appeared in the Proceedings of the 8th SWAT 2002, LNCS 2368, pages 150-159, Springer-Verlag, 2002