Abstract
The vertex cover is a classical NP-complete problem that has received great attention these last decades. A conjecture states that there is no c-approximation polynomial algorithm for it with c a constant strictly less than 2. In this paper we propose a new algorithm with approximation ratio strictly less than 2 (but non constant). Moreover we show that our algorithm has the potential to return any optimal solution.
This work is supported by the French Agency for Research under the DEFIS program TODO, ANR-09-EMER-010.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Angel, E., Campigotto, R., Laforest, C.: Analysis and comparison of three algorithms for the vertex cover problem on large graphs with low memory capacities. Algorithmic Operations Research 6(1), 56–67 (2011)
Angel, E., Campigotto, R., Laforest, C.: Implementation and comparison of heuristics for the vertex cover problem on huge graphs. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 39–50. Springer, Heidelberg (2012)
Bar-Yehuda, R., Even, S.: A local ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–45 (1985)
Birmelé, E., Delbot, F., Laforest, C.: Mean analysis of an online algorithm for the vertex cover problem. Information Processing Letters 109(9), 436–439 (2009)
Delbot, F., Laforest, C.: A better list heuristic for vertex cover. Information Processing Letters 107(3-4), 125–127 (2008)
Delbot, F., Laforest, C.: Analytical and experimental comparison of six algorithms for the vertex cover problem. ACM Journal of Experimental Algorithmics 15, 1.4:1.1–1.4:1.27 (2010)
Delbot, F., Laforest, C., Phan, R.: New approximation algorithms for the vertex cover problem and variants. Research Report RR-13-02, LIMOS, Clermont Ferrand, France (2013)
Håstad, J.: Some optimal inapproximability results. In: STOC, pp. 1–10 (1997)
Karakostas, G.: A better approximation ratio for the vertex cover problem. ACM Transactions on Algorithms 5, 41:1–41:8 (2009)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2 − ε. Journal of Computer and System Sciences 74(3), 335–349 (2008)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall (1982)
Savage, C.: Depth-first search and the vertex cover problem. Inf. Process. Lett. 14(5), 233–235 (1982)
Vazirani, V.V.: Approximation algorithms. Springer (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delbot, F., Laforest, C., Phan, R. (2013). New Approximation Algorithms for the Vertex Cover Problem. In: Lecroq, T., Mouchard, L. (eds) Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45278-9_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-45278-9_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45277-2
Online ISBN: 978-3-642-45278-9
eBook Packages: Computer ScienceComputer Science (R0)