Hardness of Approximating Independent Domination in Circle Graphs-Reference-Cited by-同舟云学术

Hardness of Approximating Independent Domination in Circle Graphs

Published:1999 Issue: Volume: Page:56-69
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Damian-Iordache Mirela,Pemmaraju Sriram V.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46632-0_7

Reference19 articles.

1. Sanjeev Arora and Carsten Lund. Hardness of approximation. In Dorit S. Hochbaum, 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 ofWaterloo,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.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extension and Its Price for the Connected Vertex Cover Problem;Lecture Notes in Computer Science;2019

2. On the max min vertex cover Problem;Approximation and Online Algorithms;2014

3. Parameterized Domination in Circle Graphs;Theory of Computing Systems;2013-05-11

4. Parameterized Domination in Circle Graphs;Graph-Theoretic Concepts in Computer Science;2012

5. The complexity of dissociation set problems in graphs;Discrete Applied Mathematics;2011-08