Complexity and Approximation Results for the Connected Vertex Cover Problem-Reference-Cited by-同舟云学术

Complexity and Approximation Results for the Connected Vertex Cover Problem

Published: Issue: Volume: Page:202-213
ISSN:
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Escoffier Bruno,Gourvès Laurent,Monnot Jérôme

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-74839-7_20.pdf

Reference22 articles.

1. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1-2), 123–134 (2000)

2. Arkin, E.M., Halldórsson, M.M., Hassin, R.: Approximating the tree and tour covers of a graph. Inf. Process. Lett. 47(6), 275–282 (1993)

3. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation (Combinatorial Optimization Problems and Their Approximability Properties). Springer, Berlin (1999)

4. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)

5. Bar-Yehuda, R., Even, S.: On approximating a vertex cover for planar graphs. In: STOC, pp. 303–309 (1982)

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

1. Partition in High Dimensional Spaces;Handbook of Combinatorial Optimization;2013

2. Connected Feedback Vertex Set in Planar Graphs;Graph-Theoretic Concepts in Computer Science;2010

3. Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs;Graph Theoretic Concepts in Computer Science;2010

4. Connected Vertex Covers in Dense Graphs;Lecture Notes in Computer Science