A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
We resolve in the affirmative a question of Boppana and Bui: whether simulated annealing can. with high probability and in polynomial time, find the optimal bisection of a random graph in v. (By using a slightly modified neighborhood structure, the number of steps can bc reduced to O(n'+' ). ) We leave open the question of whether annealing is clrective for 11 in the range 1 Corresponding author.doi:10.1016/s0166-218x(97)00133-9 fatcat:t5hmcp5jdjgqdexpjzutk4r2gi