Skip to Main content Skip to Navigation
Conference papers

New Approximation Algorithms for the Vertex Cover Problem

François Delbot 1 Christian Laforest Raksmey Phan
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
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.
Document type :
Conference papers
Complete list of metadata
Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Tuesday, October 13, 2015 - 5:04:11 PM
Last modification on : Friday, January 8, 2021 - 5:48:02 PM

Links full text



François Delbot, Christian Laforest, Raksmey Phan. New Approximation Algorithms for the Vertex Cover Problem. 24th International Workshop, IWOCA 2013, Jul 2013, Rouen, France. pp.438-442, ⟨10.1007/978-3-642-45278-9_39⟩. ⟨hal-01215211⟩



Record views