Not checkedNot checked for notices yet.
Correction: Automatically Generated Algorithms for the Vertex Coloring Problem.
Carlos Contreras Bolton, Gustavo Gatica, Víctor Parada
PLoS ONE · 2013
doi:10.1371/annotation/2a72b19b-2c45-4d7e-8f3c-582eb1f57af8 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
The vertex coloring problem is a classical problem in combinatorial optimization that consists of assigning a color to each vertex of a graph such that no adjacent vertices share the same color, minimizing the number of colors used.Despite the various practical applications that exist for this problem, its NP-hardness still represents a computational challenge.Some of the best computational results obtained for this problem are consequences of hybridizing the various known heuristics.Automatically revising the space constituted by combining these techniques to find the most adequate combination has received less attention.In this paper, we propose exploring the heuristics space for the vertex coloring problem using evolutionary algorithms.We automatically generate three new algorithms by combining elementary heuristics.To evaluate the new algorithms, a computational experiment was performed that allowed comparing them numerically with existing heuristics.The obtained algorithms present an average 29.97% relative error, while four other heuristics selected from the literature present a 59.73% error, considering 29 of the more difficult instances in the DIMACS benchmark.
Abstract licence: CC BY
References40
40 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.