CE+LS hybrid metaheuristic overcomes stagnation in cross-entropy for Soft Happy Colouring by restricting search to local optima, proving exponential KL-divergence decay and outperforming prior heuristics on 28,000 SBM graphs.
Improved approximation algorithms for the maximum happy vertices and edges problems.Algorith- mica, 80(5):1412–1438, May 2018
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Overcoming Tight Constraints in Soft Happy Colouring
CE+LS hybrid metaheuristic overcomes stagnation in cross-entropy for Soft Happy Colouring by restricting search to local optima, proving exponential KL-divergence decay and outperforming prior heuristics on 28,000 SBM graphs.