Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs

(1) , (2) , (3)
1
2
3

Abstract

We present in this paper an experimental study of six heuristics for a well-studied NP-complete graph problem: the vertex cover. These algorithms are adapted to process huge graphs. Indeed, executed on a current laptop computer, they offer reasonable CPU running times (between twenty seconds and eight hours) on graphs for which sizes are between 200 *106 and 100 *109 vertices and edges. We have run algorithms on specific graph families (we propose generators) and also on random power law graphs. Some of these heuristics can produce good solutions. We give here a comparison and an analysis of results obtained on several instances, in terms of quality of solutions and complexity, including running times.
Fichier principal
Vignette du fichier
publi1734.pdf (161.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00741605 , version 1 (14-04-2014)

Identifiers

Cite

Eric Angel, Romain Campigotto, Christian Laforest. Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs. 11th International Symposium on Experimental Algorithm (SEA 2012), Jun 2012, Bordeaux, France. pp.39--50, ⟨10.1007/978-3-642-30850-5_5⟩. ⟨hal-00741605⟩
162 View
997 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More