{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:39:46Z","timestamp":1737005986648,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_2","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:58:07Z","timestamp":1178211487000},"page":"2-5","source":"Crossref","is-referenced-by-count":0,"title":["Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems"],"prefix":"10.1007","author":[{"given":"Russell","family":"Impagliazzo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013192, 1984.","DOI":"10.1109\/SFCS.1984.715914"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013285, 1987.","DOI":"10.1109\/SFCS.1987.22"},{"key":"2_CR3","unstructured":"T. Carson, Empirical and Analytic Approaches to Understanding Local Search Heuristics, Ph.D. thesis, University of California at San Diego, 2001."},{"key":"2_CR4","unstructured":"T. Carson and R. Impagliazzo, Hill-climbing finds random planted bisections, SODA, 2001."},{"key":"2_CR5","unstructured":"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."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"A. Condon and R. M. Karp. Algorithms for Graph Partitioning on the Planted Bisection Model, RANDOM-APPROX\u201999, pages 221\u201332, 1999.","DOI":"10.1007\/978-3-540-48413-4_23"},{"key":"2_CR7","unstructured":"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\u2013520, 1998."},{"key":"2_CR8","unstructured":"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\u2013285, 1987"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"M. R. Jerrum and G. Sorkin. Simulated annealing for graph bisection. In Proceedings 34th IEEE Symposium on Foundations of Computer Science (FOCS), pages 94\u2013103, 1993.","DOI":"10.1109\/SFCS.1993.366878"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D. S. Johnson","year":"1989","unstructured":"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\u2013892, 1989.","journal-title":"Operations Research"},{"key":"2_CR11","unstructured":"A. Juels, Topics in Black Box Optimization, Ph.D. thesis, University of California at Berkeley, 1996."}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:48:27Z","timestamp":1736988507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}