Analysis of an Iterated Local Search Algorithm for Vertex Coloring
From MaRDI portal
Publication:3060746
DOI10.1007/978-3-642-17517-6_31zbMath1310.68192OpenAlexW1547915777MaRDI QIDQ3060746
Christine Zarges, Dirk Sudholt
Publication date: 9 December 2010
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17517-6_31
Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
On easiest functions for mutation operators in bio-inspired optimisation ⋮ Memetic algorithms outperform evolutionary algorithms in multimodal optimisation ⋮ Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
This page was built for publication: Analysis of an Iterated Local Search Algorithm for Vertex Coloring