Skip to main content
SpringerLink
Log in

Complexity and Approximation Results for the Connected Vertex Cover Problem

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4769))

Included in the following conference series:

Abstract

We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal graphs, has a PTAS in planar graphs, is APX-hard in bipartite graphs and is 5/3-approximable in any class of graphs where the vertex cover problem is polynomial (in particular in bipartite graphs).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

  6. Bodlaender, H.L.: A partial -arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1-2), 1–45 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Brandstadt, A., Le, V.B., Spinrad, J.: Graph classes: a survey. Society for Industrial and Applied Mathematic, Philadelphia (1999)

    Google Scholar 

  8. Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N.: Approximation schemes for first-order definable optimisation problems. In: LICS, pp. 411–420 (2006)

    Google Scholar 

  9. Demaine, E.D., Hajiaghayi, M.T.: Bidimensionality: new connections between fpt algorithms and ptass. In: SODA, pp. 590–601 (2005)

    Google Scholar 

  10. Fernau, H., Manlove, D.: Vertex and edge covers with clustering properties: Complexity and algorithms. In: Algorithms and Complexity in Durham, pp. 69–84 (2006)

    Google Scholar 

  11. Fujito, T.: How to trim an mst: A 2-approximation algorithm for minimum cost tree cover. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 431–442. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem in NP complete. SIAM Journal of Applied Mathematics 32, 826–834 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  13. Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)

    Google Scholar 

  14. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 36–48. Springer, Heidelberg (2005)

    Google Scholar 

  15. Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2 − ε. In: IEEE Conference on Computational Complexity, pp. 379–386. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  16. Könemann, J., Konjevod, G., Parekh, O., Sinha, A.: Improved approximations for tour and tree covers. Algorithmica 38(3), 441–449 (2003)

    Article  Google Scholar 

  17. Mölle, D., Richter, S., Rossmanith, P.: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 270–280. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  18. Mölle, D., Richter, S., Rossmanith, P.: Enumerate and expand: New runtime bounds for vertex cover variants. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 265–273. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Moser, H.: Exact algorithms for generalizations of vertex cover. Master’s thesis, Institut für Informatik, Friedrich-Schiller-Universität Jena (2005)

    Google Scholar 

  20. Savage, C.D.: Depth-first search and the vertex cover problem. Inf. Process. Lett. 14(5), 233–237 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  21. Ueno, S., Kajitani, Y., Gotoh, S.: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. Discrete Mathematics 72, 355–360 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  22. Wanatabe, T., Kajita, S., Onaga, K.: Vertex covers and connected vertex covers in 3-connected graphs. In: IEEE International Sympoisum on Circuits and Systems, pp. 1017–1020. IEEE Computer Society Press, Los Alamitos (1991)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS-LAMSADE, Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, F-75775 Paris Cedex 16, France

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

Authors
  1. Bruno Escoffier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent Gourvès
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jérôme Monnot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andreas Brandstädt Dieter Kratsch Haiko Müller

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Escoffier, B., Gourvès, L., Monnot, J. (2007). Complexity and Approximation Results for the Connected Vertex Cover Problem. In: Brandstädt, A., Kratsch, D., Müller, H. (eds) Graph-Theoretic Concepts in Computer Science. WG 2007. Lecture Notes in Computer Science, vol 4769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74839-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74839-7_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74838-0

  • Online ISBN: 978-3-540-74839-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation