ACM Symposium on Discrete Algorithms, SODA 2016

Article Details
Title: Approximate Undirected Maximum Flows in O(mpolylog(n)) Time
Article URLs:
Alternative Article URLs:
Authors: Richard Peng
  • Georgia Institute of Technology
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/Peng16
Author Comments:

Discuss this paper and its artifacts below