Hill-climbing finds random planted bisections

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 903-909

  Carson, Ted ^a   Impagliazzo, Russell ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

EID: 65549162154     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. D. Aldous, and U. Vazirani. "Go with the winners" Algorithms. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 492-501, 1994.
2. N Alon, Eigen values and expanders, Combinatorica, v.6 n.2, p.83-96, 1986 [doi〉10.1007/BF02579166]
3. 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.
4. 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.
5. Ted Herbert Carson , Russell Impagliazzo, Empirical and analytic approaches to understanding local search heuristics, 2001
6. T. Carson and R. Impagliazzo. Determining regions of related solutions for graph bisection problems, International Joint Conference on Artificial Intelligence, Workshop ML-I: Machine Learning for Large-Scale Optimization, 1999.
7. Anne Condon , Richard M. Karp, Algorithms for Graph Partitioning on the Planted Partition Model, Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques, p.221-232, August 08-11, 1999
8. Tassos Dimitriou , Russell Impagliazzo, Towards an analysis of local optimization algorithms, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.304-313, May 22-24, 1996, Philadelphia, Pennsylvania, United States [doi〉10.1145/237814.237882]
9. Tassos Dimitriou , Russell Impagliazzo, Go with the winners for graph bisection, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.510-520, January 25-27, 1998, San Francisco, California, United States
10. 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
11. 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.
12. Mark Jerrum , Alistair Sinclair, Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.235-244, May 02-04, 1988, Chicago, Illinois, United States [doi〉10.1145/62212.62234]
13. David S. Johnson , Cecilia R. Aragon , Lyle A. McGeoch , Catherine Schevon, Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning, Operations Research, v.37 n.6, p.865-892, Nov-Dec. 1989
14. Ari Juels , Alistair Sinclair, Topics in black-box combinatorial optimization, 1996
15. Galen H. Sasaki , Bruce Hajek, The time complexity of maximum matching by simulated annealing, Journal of the ACM (JACM), v.35 n.2, p.387-403, April 1988 [doi〉10.1145/42282.46160]
16. B. Selman. Near-optimal plans, tractability, and reactivity. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference, pages 521-529, 1994.
17. C.W. Yeh, C.K. Cheng and T.T.Y. Lin. Optimization by iterative improvement: an experimental evaluation on two-way partitioning. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 14(2): 145-53, 1995.