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:30 - 1 self

Active Bibliography

203 The Markov Chain Monte Carlo method: an approach to approximate counting and integration – Mark Jerrum, Alistair Sinclair - 1996
2 Empirical and Analytic Approaches to Understanding Local Search Heuristics – Ted Carson - 2001
24 Algorithms for Graph Partitioning on the Planted Partition Model – Anne Condon, Richard M. Karp - 1999
19 Combinatorial Optimization – M. Grötschel, L. Lovász - 1993
9 Hill-Climbing Finds Random Planted Bisections – Ted Carson, Russell Impagliazzo - 2001
3 Combinatorial Optimization: A Survey – Martin Grötschel, Lászlo Lovász - 1993
1 Heuristics for the MinLA Problem: An Empirical and Theoretical Analysis (Extended Abstract) – Josep Díaz, Jordi Petit i Silvestre, María José Serna, Jordi Petit, Paul Spirakis - 1998
23 Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning – Roberto Battiti, Alan Bertossi - 1998
175 Recent Directions in Netlist Partitioning: A Survey – Charles J. Alpert, Andrew B. Kahng
64 Spectral Partitioning of Random Graphs – Frank McSherry - 2001
3 Searching Randomly for Maximum Matchings – Oliver Giel, Ingo Wegener - 2004
3 Their Problems Are My Problems -- The Transition between Internal and External Conflict – Markus Hannebauer - 2000
2 A Formalization of Autonomous Dynamic Reconfiguration in Distributed Constraint Satisfaction – Markus Hannebauer - 2000
22 Hiding Cliques for Cryptographic Security – Ari Juels, Marcus Peinado - 1998
3 Quadratic Dynamical Systems (Preliminary Version) – Yuri Rabinovich, Alistair Sinclair, Avi Wigderson - 1992
173 Random Walks on Graphs: A Survey – L. Lovász - 1993
153 Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems – Sanjeev Arora, David Karger, Marek Karpinski - 1995
3 Simple algorithms for graph partition problems, Research Report C-212 – Osamu Watanabe, Mikael Onsjö, Mikael Onsjö - 2005
Coping with NP-hardness: Approximating minimum bisection and heuristics for maximum clique – Robert Krauthgamer - 2001