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

• Type: Journal
• Year: 2002
• Where: CORR
• Authors: András A. Benczúr, David R. Karger
• Keywords: CORR 2002, Ç´ÒÐÓ Òµ-edge Graph, Education, Original Graph, Random Sampling Techniques