Abstract
While knowing a problem is NP-complete tells us something about a problem’s worst-case complexity, it tells us little about how intractible specific distributions of instances really are, whether these distributions are mathematically defined or come from real-world applications. Frequently, NP-complete problems have been successfully attacked on “typical” instances using heuristic methods. Little is known about when or why some of these heuristics succeed.
Research Supported by NSF Award CCR-9734880, NFS Award CCR-9734911, grant #93025 of the joint US-Czechoslovak Science and Technology Program, and USAIsrael BSF Grant 97-001883
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser. Graph bisection algorithms with good average case behavior. In Proceedings of the 25th IEEE Symposium on Foundations of Computer Science, pages 181–192, 1984.
R. B. Boppana. Eigenvalues and graph bisection: An average case analysis. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 280–285, 1987.
T. Carson, Empirical and Analytic Approaches to Understanding Local Search Heuristics, Ph.D. thesis, University of California at San Diego, 2001.
T. Carson and R. Impagliazzo, Hill-climbing finds random planted bisections, SODA, 2001.
T. Carson and R. Impagliazzo. Determining regions of related solutions for graph bisection problems, International Joint Conference on Artificial Intelligence, Workshop ML-1: Machine Learning for Large-Scale Optimization, 1999.
A. Condon and R. M. Karp. Algorithms for Graph Partitioning on the Planted Bisection Model, RANDOM-APPROX’99, pages 221–32, 1999.
A. Dimitriou and R. Impagliazzo. Go-with-the-winnners algorithms for graph bisection, In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pages 510–520, 1998.
M. Dyer and A. Frieze. Fast solution of some random NP-hard problems. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 280–285, 1987
M. R. Jerrum and G. Sorkin. Simulated annealing for graph bisection. In Proceedings 34th IEEE Symposium on Foundations of Computer Science (FOCS), pages 94–103, 1993.
D. S. Johnson, C. R. Aragon, L. A. McGeoch and C. Schevon. Optimization by Simulated Annealing: An Experimental Evaluation, Part I (Graph Partitioning). Operations Research 37:865–892, 1989.
A. Juels, Topics in Black Box Optimization, Ph.D. thesis, University of California at Berkeley, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Impagliazzo, R. (2001). Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems. In: Goemans, M., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds) Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. RANDOM APPROX 2001 2001. Lecture Notes in Computer Science, vol 2129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44666-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-44666-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42470-3
Online ISBN: 978-3-540-44666-8
eBook Packages: Springer Book Archive