Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs

13 years 4 months ago

Download www.cc.gatech.edu

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

Real-time Traffic

CORR 2002 | Ç´ÒÐÓ Òµ-edge Graph | Education | Original Graph | Random Sampling Techniques |

claim paper

» Polynomial time approximation schemes for dense instances of NPhard problems

» Inapproximability Results for Maximum Edge Biclique Minimum Linear Arrangement and Sparses...

» Product Multicommodity Flow in Wireless Networks

» Combinatorial Algorithms for the Unsplittable Flow Problem

» Truthful Unsplittable Flow for Large Capacity Networks

» Optical flow robust estimation in a hybrid multiresolution MRF framework

» Improved Approximation Algorithms for Maximum Graph Partitioning Problems

» Solving Markov Random Fields using Second Order Cone Programming Relaxations

Post Info
More Details (n/a)

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)

Sciweavers

Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs

CORR 2002 | Ç´ÒÐÓ Òµ-edge Graph | Education | Original Graph | Random Sampling Techniques |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers