Sciweavers

Share
CORR
2002
Springer

Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs

8 years 8 months ago
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any graph on
András A. Benczúr, David R. Karger
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where CORR
Authors András A. Benczúr, David R. Karger
Comments (0)
books