Skip to main content
SpringerLink
Log in

Combining Two Worlds: Parameterised Approximation for Vertex Cover

  • Conference paper
Book cover Algorithms and Computation (ISAAC 2010)

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

Included in the following conference series:

Abstract

We explore opportunities for parameterising constant factor approximation algorithms for vertex cover. We provide a simple algorithm that works on any approximation ratio of the form \(\frac {2l+1}{l+1}\) and has complexity that outperforms an algorithm by Bourgeois et al. derived from a sophisticated exact parameterised algorithm. In particular, for l = 1 (factor 1.5 approximation) our algorithm runs in time \(\mathcal{O}^{*}(1.09^{k})\). Additionally, we present an improved polynomial-time approximation algorithm for graphs of average degree four.

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. Bar-Yehuda, R.: One for the price of two: a unified approach for approximating covering problems. Algorithmica 27, 131–144 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Berman, P., Fujito, T.: On approximation properties of the independent set problem for degree 3 graphs. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 449–460. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  3. Bourgeois, N., Escoffier, B., Paschos, V.T.: Efficient approximation of combinatorial problems by moderately exponential algorithms. In: Dehne, F. (ed.) WADS 2009. LNCS, vol. 5664, pp. 507–518. Springer, Heidelberg (2009)

    Google Scholar 

  4. Cai, L., Huang, X.: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. Algorithmica 57(2), 398–412 (2010)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Sunil Chandran, L., Grandoni, F.: Refined memorization for vertex cover. Information Processing Letters 93, 125–131 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. J. Algorithms 41, 280–301 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chen, J., Kanj, I.A., Xia, G.: Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems. Algorithmica 43, 245–273 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 238–249. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Chen, Y., Grohe, M., Grüber, M.: On parameterized approximability. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 109–120. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Dantsin, E., Gavrilovich, M., Hirsch, E.A., Konev, B.: MAX SAT approximation beyond the limits of polynomial-time approximation. Ann. Pure Appl. Logic 113(1-3), 81–94 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. J. ACM 52(6), 866–893 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162, 439–485 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Halldórsson, M., Radhakrishnan, J.: Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. Algorithmica 18(1), 145–163 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  15. Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics 6, 243–254 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kanj, I.: Vertex Cover: Exact and Approximation Algorithms and Applications. Phd Thesis, Texas A& M University (2001)

    Google Scholar 

  17. Karakostas, G.: A better approximation ratio for the vertex cover problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1043–1050. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2 − ε. J. Computer and System Sciences 74, 335–349 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  19. Marx, D.: Parameterized complexity and approximation algorithms. The Computer Journal 51(1), 60–78 (2008)

    Article  Google Scholar 

  20. 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 

  21. Xiao, M.: A note on vertex cover in graphs with maximum degree 3. In: Thai, T. (ed.) COCOON 2010. LNCS, vol. 6196, pp. 150–159. Springer, Heidelberg (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, The University of Newcastle, Callaghan, NSW, 2308, Australia

    Ljiljana Brankovic

  2. Fachbereich 4, Abteilung Informatik, Universität Trier, 54286, Trier, Germany

    Henning Fernau

Authors
  1. Ljiljana Brankovic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, KAIST, Gwahangno 335, 305-701, Yuseong-gu, Daejeon, Korea

    Otfried Cheong  & Kyung-Yong Chwa  & 

  2. School of Computer Science and Engineering, Seoul National University, 151-742, Seoul, Korea

    Kunsoo Park

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brankovic, L., Fernau, H. (2010). Combining Two Worlds: Parameterised Approximation for Vertex Cover. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17517-6_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17517-6_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17516-9

  • Online ISBN: 978-3-642-17517-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation