Abstract
We present an improved dynamic programming strategy for dominating set and related problems on graphs that are given together with a tree decomposition of width k. We obtain an O(4k n) algorithm for dominating set, where n is the number of nodes of the tree decomposition. This result improves the previously best known algorithm of Telle and Proskurowski running in time O(9k n). The key to our result is an argument on a certain “monotonicity” in the table updating process during dynamic programming.
Moreover, various other domination-like problems as discussed by Telle and Proskurowski are treated with our technique. We gain improvements on the base of the exponential term in the running time ranging between 55% and 68% in most of these cases. These results mean significant breakthroughs concerning practical implementations.
Supported by the Deutsche Forschungsgemeinschaft (DFG), research project PEAL (Parameterized complexity and Exact ALgorithms), NI 369/1-1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Alber, H. L. Bodlaender, H. Fernau, and R. Niedermeier. Fixed parameter algorithms for planar dominating set and related problems. In Proceedings 7th SWAT 2000, Springer-Verlag LNCS 1851, pp. 97–110, 2000.
J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speed-up for planar graph problems. In Proceedings 28th ICALP 2001, Springer-Verlag LNCS 2076, pp. 261–272, 2001.
J. Alber, F. Dorn, and R. Niedermeier. Experiments on optimally solving parameterized problems on planar graphs. Manuscript, December 2001.
B. Aspvall, A. Proskurowski, and J. A. Telle. Memory requirements for table computations in partial k-tree algorithms. Algorithmica 27: 382–394, 2000.
D. Bienstock and C. L. Monma. On the complexity of covering vertices by faces in a planar graph. SIAM J. Comput. 17:53–76, 1988.
H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25:1305–1317, 1996.
H. L. Bodlaender. Treewidth: Algorithmic techniques and results. In Proceedings 22nd MFCS’97, Springer-Verlag LNCS 1295, pp. 19–36, 1997.
A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, 1999.
J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. In Proceedings 25th WG, Springer-Verlag LNCS 1665, pp. 313–324, 1999.
D. G. Corneil and J. M. Keil. A dynamic programming approach to the dominating set problem on k-trees. SIAM J. Alg. Disc. Meth., 8: 535–543, 1987.
R. G. Downey and M. R. Fellows. Parameterized Complexity. Monographs in Computer Science. Springer-Verlag, 1999.
T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in Graphs. Monographs and textbooks in Pure and Applied Mathematics Vol. 208, Marcel Dekker, 1998.
T. W. Haynes, S. T. Hedetniemi, and P. J. Slater eds.. Domination in Graphs; Advanced Topics. Monographs and textbooks in Pure and Applied Mathematics Vol. 209, Marcel Dekker, 1998.
T. Kloks. Treewidth. Computations and Approximations. Springer-Verlag LNCS 842, 1994.
A. M. C. A. Koster, H. L. Bodlaender, and S. P. M. Hoesel. Treewidth: Computational Experiments. Electronic Notes in Discrete Mathematics 8, Elsevier Science Publishers, 2001.
D. Kratsch. Algorithms. Chapter 8 in [13].
K. Mehlhorn and S. Näher. LEDA: A Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, England, 1999.
R. Niedermeier and P. Rossmanith. Upper bounds for Vertex Cover further improved. In Proc. 16th STACS’99, Springer-Verlag LNCS 1563, pp. 561–570, 1999.
J. A. Telle. Complexity of domination-type problems in graphs. Nordic J. Comput. 1:157–171, 1994.
J. A. Telle and A. Proskurowski. Practical algorithms on partial k-trees with an application to domination-like problems. In Proceedings 3rd WADS’93, Springer-Verlag LNCS 709, pp. 610–621, 1993.
J. A. Telle and A. Proskurowski. Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discr. Math. 10(4):529–550, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alber, J., Niedermeier, R. (2002). Improved Tree Decomposition Based Algorithms for Domination-like Problems. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_52
Download citation
DOI: https://doi.org/10.1007/3-540-45995-2_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43400-9
Online ISBN: 978-3-540-45995-8
eBook Packages: Springer Book Archive