Approximation hardness of dominating set problems in bounded degree graphs

Information and Computation

Volumn 206, Issue 11, 2008, Pages 1264-1275

  Chlebik M ^a   Chlebikova J ^b  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b Faculty of Natural Sciences   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL THEORY; GRAPH THEORY; HARDNESS; POLYNOMIAL APPROXIMATION;

APPROXIMATION HARDNESS; APPROXIMATION LOWER BOUNDS; BOUNDED DEGREE GRAPHS; DEGREE BOUNDS; DIRECTED GRAPHS; DOMINATING SET PROBLEMS; LOWER BOUNDS; MAXIMUM INDUCED MATCHING; MINIMUM DOMINATING SET; MINIMUM SET COVER; SPANNING TREES; UPPER BOUNDS;

SET THEORY;

EID: 53449094626     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.07.003     Document Type: Article

References (18)

1. P. Alimonti, T. Calamoneri, Improved approximations of independent dominating set in bounded degree graphs, in: Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG, LNCS, 1996, pp. 2-16.
2. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation (1999), Springer, Berlin
3. Chlebi{dotless}́k M., and Chlebi{dotless}́ková J. Approximation hardness of edge dominating set problems. Journal of Combinatorial Optimization 11 (2006) 279-290
4. Chlebi{dotless}́k M., and Chlebi{dotless}́ková J. Complexity of approximating bounded variants of optimization problems. Theoretical Computer Science 354 (2006) 320-338
5. I. Dinur, V. Guruswami, S. Khot, O. Regev, A new multilayered PCP and the hardness of hypergraph vertex cover, in: Proceedings of the 35th ACM Symposium on Theory of Computing, STOC, 2003, pp. 595-601.
6. I. Dinur, S. Safra, The importance of being biased, in: Proceedings of the 34th ACM Symposium on Theory of Computing, STOC, 2002, pp. 33-42.
7. Duckworth W., Manlove D.F., and Zito M. On the approximability of the maximum induced matching problem. Journal of Discrete Algorithms 3 (2005) 79-91
8. R. Duh, M. Fürer, Approximation of k-set cover by semi-local optimization, in: Proceedings of the 29th ACM Symposium on Theory of Computing, STOC, 1997, pp. 256-264.
9. Feige U. A threshold of ln n for approximation set cover. Journal of ACM 45 4 (1998) 634-652
10. Galbiati G., Maffioli F., and Morzenti A. A short note on the approximability of the maximum leaves spanning tree problem. Information Processing Letters 52 (1994) 45-49
11. S. Guha, S. Khuller, Approximation algorithms for connected dominating sets, in: Proceedings of the 4th Annual European Symposium on Algorithms, ESA, LNCS, vol. 1136, 1996, pp. 179-193.
12. Halldórsson M.M. Approximating the minimum maximal independence number. Information Processing Letters 46 (1993) 169-172
13. Håstad J. Some optimal inapproximability results. Journal of ACM 48 4 (2001) 798-859
14. Irving H.W. On approximating the minimum independent dominating set. Information Processing Letters 37 (1991) 197-200
15. Ko C.W., and Shepherd F.B. Bipartite domination and simultaneous matroid covers. Siam Journal of Discrete Mathematics 16 4 (2003) 517-523
16. H. Lu, R. Ravi, The power of local optimization: approximation algorithms for maximum-leaf spanning tree, in: Proceedings of the 30th Annual Allerton Conference on Communication, Control and Computing, 1992, pp. 533-542.
17. L. Trevisan, Non-approximability results for optimization problems on bounded degree instances, in: Proceedings of the 33rd Symposium on Theory of Computing, STOC, 2001, pp. 453-461.
18. M. Zito, Maximum induced matching in regular graphs and trees, in: Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG, LNCS, vol. 1665, 1999, pp. 89-100.