Edge-Bisection of Chordal Rings
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Improved Algorithms for the Random Cluster Graph Model
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Simulated Annealing for Convex Optimization
Mathematics of Operations Research
Theoretical Computer Science
Single- and multi-objective evolutionary algorithms for graph bisectioning
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Necessary and sufficient conditions for success of the metropolis algorithm for optimization
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Simulated annealing beats metropolis in combinatorial optimization
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A comparison of simulated annealing with a simple evolutionary algorithm
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Sorting noisy data with partial information
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
We resolve in the affirmative a question of R.B. Boppana and T. Bui: whether simulated annealing can with high probability and in polynomial time, find the optimal bisection of a random graph an G/sub npr/ when p-r=(/spl Theta/n/sup /spl Delta/-2/) for /spl Delta//spl les/2. (The random graph model G/sub npr/ specifies a "planted" bisection of density r, separating two n/2-vertex subsets of slightly higher density p.) We show that simulated "annealing" at an appropriate fixed temperature (i.e., the Metropolis algorithm) finds the unique smallest bisection in O(n/sup 2+/spl epsi//) steps with very high probability, provided /spl Delta/11/6. (By using a slightly modified neighborhood structure, the number of steps can be reduced to O(n/sup 1+/spl epsi//).) We leave open the question of whether annealing is effective for /spl Delta/ in the range 3/2