3 papers
cs.NE2026
Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring
Johanna Gasse, Antonia Heinen, Felix Knöfel +2
We analyze the two combinatorial problems of Dominating Set and Vertex Coloring regarding what kind of local optima are present for various instances. For a variety of graph classe…
cs.NE2026
Gray-Box Optimization and the Vertex Coloring Problem
Johanna Gasse, Antonia Heinen, Hendrik Higl +1
Gray-box optimization is an approach for making some problem-specific information available to the algorithm while still relying on fitness information as the main guide to an opti…
cs.NE2026
Anytime Analysis on BinVal: Adaptive Parameters Help
Timo Kötzing, Jurek Sander
While most theoretical run time analyses of discrete randomized search heuristics provide bounds on the expected number of evaluations to find the global optimum, we consider the a…