Go with the winners for graph bisection
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hill-climbing finds random planted bisections
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Graph Partitioning on the Planted Partition Model
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Topics in black-box combinatorial optimization
Topics in black-box combinatorial optimization
Empirical and analytic approaches to understanding local search heuristics
Empirical and analytic approaches to understanding local search heuristics
Eigenvalues and graph bisection: An average-case analysis
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Graph Bisection Algorithins With Good Average Case Behavior
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Simulated annealing for graph bisection
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Hi-index | 0.00 |