Computing Maximum Flow with Augmenting Electrical Flows

Computing Maximum Flow with Augmenting Electrical Flows

Show other versions (1)

We present an Õ (m 7/10 U 1/7)-time algorithm for the maximum s-t flow problem (and the minimum s-t cut problem) in directed graphs with m arcs and largest integer capacity U. This matches the running time of the Õ (mU)10/7)- time algorithm of Madry [30] in the unit-capacity case, and improves ove...

Full description

Bibliographic Details
Main Author: Madry, Aleksander
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers (IEEE) 2018
Online Access:http://hdl.handle.net/1721.1/113573
https://orcid.org/0000-0003-0536-0323

Internet

http://hdl.handle.net/1721.1/113573
https://orcid.org/0000-0003-0536-0323

Similar Items