Simulated annealing for graph bisection (1993)

Cached

Download Links

by Mark Jerrum
Venue:in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science
Citations:36 - 1 self

Documents Related by Co-Citation

59 Eigenvalues and graph bisection: an average case analysis – R B Boppana - 1987
114 Graph bisection algorithms with good average case behavior – T N Bui, S Chaudhuri, F T Leighton, M Sipser - 1987
91 Conductance and the rapid mixing property for Markov chains: the approximation of the permanent resolved – M Jerrum, A Sinclair - 1988
512 Optimization by Simulated Annealing: An Experimental Evaluation – D Johnson, C Aragon, L McGeoch, C Schevon - 1991
54 The time complexity of maximum matching by simulated annealing – Galen H. Sasaki, Bruce Hajek - 1988
330 EIGENVALUES AND EXPANDERS – N. Alon - 1986
572 Optimization, approximation, and complexity classes – C H Papadimitriou, M Yannakakis - 1991
10964 Computers and Intractability: A Guide to the Theory of NP-Completeness – M Garey, D Johnson - 1979
80 Finding a large hidden clique in a random graph – Noga Alon, Michael Krivelevich, Benny Sudakov - 1998
87 Relations Between Average Case Complexity and Approximation Complexity (Extended Abstract) – Urel Feige - 2002
33 Efficient simulated annealing on fractal energy landscapes. Algorithmica 6, 367–418. ECCC ISSN 1433-8092 http://www.eccc.uni-trier.de/eccc ftp://ftp.eccc.uni-trier.de/pub/eccc ftpmail@ftp.eccc.uni-trier.de, subject ’help eccc – G B Sorkin - 1991
37 Algorithms for Graph Partitioning on the Planted Partition Model – Anne Condon, Richard M. Karp - 1999
9 Fast solution of some random NP-hard problems – M E Dyer, A Frieze - 1986
73 Eigenvalues and graph bisection: An average-case analysis (extended abstract – Ravi B Boppana - 1987
270 Local Search Strategies for Satisfiability Testing – Bart Selman, Henry Kautz, Bram Cohen - 1995
148 A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies – Martin Dyer, Alan Frieze, Ravi Kannan - 1989
77 On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing – D Aldous - 1987
299 Approximating the permanent – Mark Jerrum, Alistair Sinclair - 1989
4 Go with the winners " Algorithms – D Aldous, U Vazirani - 1994