Sciweavers

Share
FOCS
1993
IEEE
8 years 8 months ago
Simulated Annealing for Graph Bisection
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...
Mark Jerrum, Gregory B. Sorkin
FOCS
2000
IEEE
8 years 8 months ago
A polylogarithmic approximation of the minimum bisection
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...
Uriel Feige, Robert Krauthgamer

Lecture Notes
4505views
10 years 2 months ago
Numerical Methods Course Notes
"These notes were originally prepared during Fall quarter 2003 for UCSD Math 174, Numerical Methods."
Steven E. Pav
books