Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs
Laforest, Christian; Campigotto, Romain; Angel, Eric (2012), Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs, in Klasing, Ralf, Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, Springer, p. 39-50. http://dx.doi.org/10.1007/978-3-642-30850-5_5
TypeCommunication / Conférence
Conference titleSEA 2012
Book titleExperimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings
Book authorKlasing, Ralf
Series titleLecture Notes in Computer Science
MetadataShow full item record
Abstract (EN)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.
Subjects / Keywordsvertex cover; low memory; huge graphs; experimental analysis; implementation of algorithms
Showing items related by title and author.
Complexity and Approximation Results for the Connected Vertex Cover Problem in Graphs and Hypergraphs Monnot, Jérôme; Gourvès, Laurent; Escoffier, Bruno (2010) Article accepté pour publication ou publié