New Approximation Algorithms for the Vertex Cover Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

New Approximation Algorithms for the Vertex Cover Problem

François Delbot
Christian Laforest
Raksmey Phan

Résumé

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.

Dates et versions

hal-01215211 , version 1 (13-10-2015)

Identifiants

Citer

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⟩
40 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More