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. © 2013 Springer-Verlag.
CITATION STYLE
Delbot, F., Laforest, C., & Phan, R. (2013). New approximation algorithms for the vertex cover problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8288 LNCS, pp. 438–442). https://doi.org/10.1007/978-3-642-45278-9_39
Mendeley helps you to discover research relevant for your work.