Local search can return arbitrarily bad colorings on general bipartite graphs, but a gray-box operator that biases against rare colors solves complete bipartite graphs in Θ(n log n) expected time.
Oliveto and Carsten Witt
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.NE 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
In the dueling bandit setting, the (1+1) EA selects the Condorcet winner with only constant probability when its advantage is Ω(1/n), while a Max-Min Ant System EDA selects it with probability 1-Θ(p), and repeated duels improve the EA's performance.
Gray-box operators enable RLS to achieve expected O(n log n) runtime for proper 2-colorings in bipartite graphs, unlike standard (1+1) EA which requires plateau guidance.
citing papers explorer
-
Local Search on Vertex Coloring for Bipartite Graphs
Local search can return arbitrarily bad colorings on general bipartite graphs, but a gray-box operator that biases against rare colors solves complete bipartite graphs in Θ(n log n) expected time.
-
Analysis of Search Heuristics in the Multi-Armed Bandit Setting
In the dueling bandit setting, the (1+1) EA selects the Condorcet winner with only constant probability when its advantage is Ω(1/n), while a Max-Min Ant System EDA selects it with probability 1-Θ(p), and repeated duels improve the EA's performance.
-
Gray-Box Optimization and the Vertex Coloring Problem
Gray-box operators enable RLS to achieve expected O(n log n) runtime for proper 2-colorings in bipartite graphs, unlike standard (1+1) EA which requires plateau guidance.