Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 2005: Algorithms and Data Structures pp 36–48Cite as

Parameterized Complexity of Generalized Vertex Cover Problems

  • Conference paper

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

Abstract

Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of approximability. However, their parameterized complexity has so far been completely open. We close this gap here by showing that, with the size of the desired vertex cover as parameter, Connected Vertex Cover and Capacitated Vertex Cover are both fixed-parameter tractable while Maximum Partial Vertex Cover is W[1]-hard. This answers two open questions from the literature. The results extend to several closely related problems. Interestingly, although the considered generalized Vertex Cover problems behave very similar in terms of constant-factor approximability, they display a wide range of different characteristics when investigating their parameterized complexities.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the Vertex Cover problem: theory and experiments. In: Proc. ALENEX 2004, pp. 62–69. ACM/SIAM (2004)

    Google Scholar 

  2. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for Dominating Set and related problems on planar graphs. Algorithmica 33(4), 461–493 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alber, J., Dorn, F., Niedermeier, R.: Experimental evaluation of a tree decomposition based algorithm for Vertex Cover on planar graphs. Discrete Applied Mathematics 145(2), 219–231 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Alber, J., Fernau, H., Niedermeier, R.: Parameterized complexity: exponential speed-up for planar graph problems. Journal of Algorithms 52, 26–56 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Alber, J., Gramm, J., Niedermeier, R.: Faster exact algorithms for hard problems: a parameterized point of view. Discrete Mathematics 229, 3–27 (2001)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Arvind, V., Raman, V.: Approximation algorithms for some parameterized counting problems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 453–464. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Balasubramanian, R., Fellows, M.R., Raman, V.: An improved fixed-parameter algorithm for Vertex Cover. Information Processing Letters 65(3), 163–168 (1998)

    Article  MathSciNet  Google Scholar 

  9. Bläser, M.: Computing small partial coverings. Information Processing Letters 85(6), 327–331 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Bshouty, N.H., Burroughs, L.: Massaging a linear programming solution to give a 2-approximation for a generalization of the Vertex Cover problem. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 298–308. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67(4), 789–807 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Chandran, L.S., Grandoni, F.: Refined memorisation for Vertex Cover. Information Processing Letters 93(3), 125–131 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Cheetham, J., Dehne, F., Rau-Chaplin, A., Stege, U., Taillon, P.J.: Solving large FPT problems on coarse-grained parallel machines. Journal of Computer and System Sciences 67(4), 691–706 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Chen, J., Kanj, I.A., Jia, W.: Vertex Cover: further observations and further improvements. Journal of Algorithms 41, 280–301 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  15. Chuzhoy, J., Naor, J.S.: Covering problems with hard capacities. In: Proc. 43rd FOCS, pp. 481–489. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  16. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  17. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  18. Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1, 195–207 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  19. Fellows, M.R.: New directions and new challenges in algorithm design and complexity, parameterized. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 505–520. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  20. Gandhi, R., Halperin, E., Khuller, S., Kortsarz, G., Srinivasan, A.: An improved approximation algorithm for Vertex Cover with hard capacities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 164–175. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  21. Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 225–236. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  22. Guha, S., Hassin, R., Khuller, S., Or, E.: Capacitated vertex covering. Journal of Algorithms 48(1), 257–270 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  24. Niedermeier, R.: Ubiquitous parameterization—invitation to fixed-parameter algorithms. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 84–103. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  25. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, forthcoming (2005)

    Google Scholar 

  26. Niedermeier, R., Rossmanith, P.: Upper bounds for vertex cover further improved. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 561–570. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  27. Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parametertractable algorithms. Information Processing Letters 73, 125–129 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  28. Niedermeier, R., Rossmanith, P.: On efficient fixed-parameter algorithms for Weighted Vertex Cover. Journal of Algorithms 47(2), 63–77 (2003)

    MATH  MathSciNet  Google Scholar 

  29. Nishimura, N., Ragde, P., Thilikos, D.M.: Fast fixed-parameter tractable algorithms for nontrivial generalizations of Vertex Cover. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 75–86. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  30. Prieto, E., Sloper, C.: Either/or: using vertex cover structure in designing FPTalgorithms—the case of k-Internal Spanning Tree. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 474–483. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, D-07743, Jena, Fed. Rep. of Germany

    Jiong Guo, Rolf Niedermeier & Sebastian Wernicke

Authors
  1. Jiong Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf Niedermeier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sebastian Wernicke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carleton University, Ottawa, Canada

    Frank Dehne

  2. Cheriton School of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ont., Canada

    Alejandro López-Ortiz

  3. School of Computer Science, Carleton University, 1125 Colonel By Drive, K1S 5B6, Ottawa, Canada

    Jörg-Rüdiger Sack

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guo, J., Niedermeier, R., Wernicke, S. (2005). Parameterized Complexity of Generalized Vertex Cover Problems. In: Dehne, F., López-Ortiz, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2005. Lecture Notes in Computer Science, vol 3608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534273_5

Download citation

  • DOI: https://doi.org/10.1007/11534273_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28101-6

  • Online ISBN: 978-3-540-31711-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation