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

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00741605
Contributor : Frédéric Davesne <>
Submitted on : Monday, April 14, 2014 - 5:16:25 PM
Last modification on : Thursday, February 13, 2020 - 2:02:12 PM
Long-term archiving on: Monday, July 14, 2014 - 10:36:18 AM

File

publi1734.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

289

Files downloads

851