Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems

Russell Impagliazzo. Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems. In Michel X. Goemans, Klaus Jansen, José D. P. Rolim, Luca Trevisan, editors, Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approxi. Volume 2129 of Lecture Notes in Computer Science, pages 2-5, Springer, 2001. [doi]

Abstract

Abstract is missing.