Hardness of approximating independent domination in circle graphs

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

Volumn 1741, Issue , 1999, Pages 56-69

  Damian Iordache, Mirela ^a   Pemmaraju, Sriram V ^b  

^a University of Iowa   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPHIC METHODS;

APPLIED MATHEMATICS; CONNECTED DOMINATING SET; DOMINATING SETS; DOMINATION PROBLEM; INDEPENDENT DOMINATING SET; INDEPENDENT DOMINATIONS; MINIMUM CONNECTED DOMINATING SET; MINIMUM DOMINATING SET;

GRAPH THEORY;

EID: 84958051526     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_7     Document Type: Conference Paper

References (19)

1. Sanjeev Arora and Carsten Lund. Hardness of approximation. In Dorit S. Hoch- baum, editor, Approximation Algorithms for NP-hard problems. PWS Publishing Company, 1997.
2. T. A. Beyer, A. Proskurowski, S.T. Hedetniemi, and S. Mitchell. Independent domination in trees. Congressus Numerantium, 19:321-328, 1977.
3. K. S. Booth. Dominating sets in chordal graphs. Technical Report CS-80-34, Department of Computer Science, University of Waterloo, Waterloo, Ontario, 1980.
4. K. S. Booth and J. H. Johnson. Dominating sets in chordal graphs. SIAM Journal on Computing, 13:335-379, 1976.
5. C. J. Colbourn and L. K. Stewart. Permutation graphs: connected domination and Steiner trees. Discrete Mathematics, 86:179-189, 1990.
6. D. G. Corneil and Y. Perl. Clustering and domination in perfect graphs. Discrete Applied Mathematics, 9:27-39, 1984.
7. Mirela Damian-Iordache and Sriram V. Pemmaraju. Domination in circle graphs with applications to polygon decomposition. Technical Report 99-02, University of Iowa, 1999.
8. A. K. Dewdney. Fast turing reductions between problems in NP, chapter 4: Reductions between NP-complete problems. Technical Report 71, Department of Computer Science, University of Western Ontario, London, Ontario, 1983.
9. M. Farber. Independent domination in chordal graphs. Operations Research Letters, 1:134-138, 1982.
10. M. Farber and J. M. Keil. Domination in permutation graphs. Journal of Algorithms, 6:309-321, 1985.
11. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in Graphs. Number 208 in Pure and Applied Mathematics: A series of monomgraphs and textbooks. Marcel Dekker Inc., New York, 1998.
12. Robert W. Irving. On approximating the minimum independent dominating set. Information Processing Letters, 37:197-200, 1991.
13. D. S. Johnson. The NP-completeness column: an ongoing guide. Journal of Algorithms, 6:434-451, 1985.
14. J. Mark Keil. The complexity of domination problems in circle graphs. Discrete Applied Mathematics, 42:51-63, 1991.
15. D. Kratsch and L. Stewart. Domination on cocomparability graphs. SIAM Journal on Discrete Mathematics, 6(3):400-417, 1993.
16. R. Laskar and J. Pfaff. Domination and irredundance in split graphs. Technical Report 430, Clemson University, 1983.
17. Y. D. Liang. Steiner set and connected domination in trapezoid graphs. Information Processing Letters, 56:101-108, 1995.
18. M.R. Garey and D.S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, New York, 1979.
19. J. Pfaff, R. Laskar, and S. T. Hedetniemi. NP-completeness of total and connected domination, and irredundance for bipartite graphs. Technical Report 428, Clemson University, 1983.