FOCS
1993
IEEE
14 years 3 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
FOCS
2000
IEEE
14 years 3 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
334
click to vote
Lecture Notes
"These notes were originally prepared during Fall quarter 2003 for UCSD Math 174, Numerical Methods."