Abstract
We study approximation hardness of the MINIMUM DOMINATING SET problem and its variants in undirected and directed graphs. We state the first explicit approximation lower bounds for various kinds of domination problems (connected, total, independent) in bounded degree graphs. For most of dominating set problems we prove asymptotically almost tight lower bounds. The results are applied to improve the lower bounds for other related problems such as the MAXIMUM INDUCED MATCHING problem and the MAXIMUM LEAF SPANNING TREE problem. © Springer-Verlag 2004.
Cite
CITATION STYLE
Chlebik, M., & Chlebíková, J. (2004). Approximation hardness of dominating set problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3221, 192–203. https://doi.org/10.1007/978-3-540-30140-0_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
