Cut Size Statistics of Graph Bisection Heuristics

DOI10.1137/S1052623497321523zbMath0955.90112arXivcond-mat/9804027OpenAlexW2048646384WikidataQ120693791 ScholiaQ120693791MaRDI QIDQ4943616

G. R. Schreiber, Olivier C. Martin

Publication date: 19 March 2000

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/9804027

zbMATH Keywords

heuristicsrankinggraph partitioningself-averaging

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Statistical thermodynamics (82B30)

Related Items (4)

Hybrid Metaheuristics: An Introduction ⋮ Bipartitioning of directed and mixed random graphs ⋮ Statistical mechanics methods and phase transitions in optimization problems ⋮ A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data

This page was built for publication: Cut Size Statistics of Graph Bisection Heuristics