Sciweavers

GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
13 years 8 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch