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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.NE 2years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
Self-adjusting mutation rates let the (1+1) EA optimize the top k bits of BinVal in O(k^{1+ε}) time independent of n for all k in o(n) simultaneously.
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.
-
Anytime Analysis on BinVal: Adaptive Parameters Help
Self-adjusting mutation rates let the (1+1) EA optimize the top k bits of BinVal in O(k^{1+ε}) time independent of n for all k in o(n) simultaneously.