Improved approximations of independent dominating set in bounded degree graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1197 LNCS, Issue , 1997, Pages 2-16

  Alimonti, Paola ^a   Calamoneri, Tiziana ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Approximation algorithms; Bounded degree graphs; Cubic graphs; Greedy; Local search; Minimum independent dominating set; Regular graphs

Indexed keywords

BOUNDED DEGREE GRAPHS; CUBIC GRAPH; GREEDY; INDEPENDENT DOMINATING SET; LOCAL SEARCH; REGULAR GRAPHS;

APPROXIMATION ALGORITHMS; COMPUTER SCIENCE; GRAPH THEORY; ITERATIVE METHODS;

GRAPHIC METHODS;

EID: 84896776540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62559-3_2     Document Type: Conference Paper

References (10)

1. P. Berman, M. Fürer, Approximating Maximum Independent Set in Bounded Degree Graphs, Proc. 5-th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, 365-371, 1994.
2. M. Bellare, O. Goldreich, M. Sudan, Free Bits, PCPs and non-approximability-towards tight results, Proc. of the 36th Annual IEEE Conference on Foundations of Computer Science, 1995.
3. P. Crescenzi and V. Kann, A Compendium of NP Optimization Problems, Manuscript, 1995.
4. R. Greenlaw and R. Petreschi, Cubic graphs, ACM Computing Surveys, 27, 471-495, 1995.
5. M.M. Halldorsson, Approximating the minimum maximal independence number, Inform. Process. Lett., 46, 169-172, 1993.
6. V. Kann, On the Approximability of NP-Complete Optimization Problems, PhD Thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockolm, 1992.
7. V. Kann, Polynomially bounded minimization problems that are hard to approximate, Nordic J. Computing, 1, 317-331, 1994.
8. C. Lund, and M. Yannakakis, On the Hardness of Approximating Minimization Problems, J. ACM 41, 960-981, 1994.
9. C. Papadimitriou, and K. Steiglitz, Combinatorial Optimization Algorithms and Optimization, Prentice-Hall, Englewood Cliffs, New Jersey, 1982.
10. C. Papadimitriou, and M. Yannakakis, Optimization, Approximation, and Complexity Classes, Journal of Computer and System Sciences, 43, 425-440, 1991.