Fetching the paper…
Reading the bibliography…
In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply it to provide asymptotically faster algorithms for the maximum $s$-$t$ flow and maximum concurrent multicommodity flow problems.
A data structure for dynamic trees
Daniel D. Sleator and Robert Endre Tarjan · 1981
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadiui Semenovich Nemirovsky and David Borisovich Yudin · 1983
Earlier work this paper cites.
Network flows
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin · 1989
Earlier work this paper cites.
Applications of network optimization
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin, and M. R. Reddy · 1995
Earlier work this paper cites.
Approximating s-t minimum cuts in Õ ( n 2 ) (n^{2}) time
András A. Benczúr and David R. Karger · 1996
Earlier work this paper cites.
An o(log k) approximate min-cut max-flow theorem and approximation algorithm
Y. Aumann and Y. Rabani · 1998
Earlier work this paper cites.
Beyond the flow decomposition barrier
Andrew V. Goldberg and Satish Rao · 1998
Earlier work this paper cites.
Nonlinear programming
Dimitri P Bertsekas · 1999
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Yurii Nesterov · 2003
Earlier work this paper cites.
Combinatorial Optimization, Volume A
Alexander Schrijver · 2003
Earlier work this paper cites.
Rounding of convex sets and efficient gradient methods for linear programming problems
Yurii Nesterov · 2004
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A. Spielman and Shang-Hua Teng · 2004
Cited alongside, same era.
Smooth minimization of non-smooth functions
Yu Nesterov · 2005
Cited alongside, same era.
Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
Daniel A. Spielman and Shang-Hua Teng · 2006
Cited alongside, same era.
Optimal hierarchical decompositions for congestion minimization in networks
Harald Räcke · 2008
Cited alongside, same era.
Graph sparsification by effective resistances
Daniel A. Spielman and Nikhil Srivastava · 2008
Cited alongside, same era.
Extensions and limits to vertex sparsification
F. Thomson Leighton and Ankur Moitra · 2010
Later among the works it cites.
Fast approximation algorithms for cut-based problems in undirected graphs
Aleksander Madry · 2010
Later among the works it cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2010
Later among the works it cites.
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng · 2011
Later among the works it cites.
A nearly-m log n time solver for sdd linear systems
Ioannis Koutis, Gary L. Miller, and Richard Peng · 2011
Later among the works it cites.
Faster approximate multicommodity flow using quadratically coupled flows
Jonathan A. Kelner, Gary L. Miller, and Richard Peng · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Daniel A. Spielman and Shang-Hua Teng · 2008
Cited alongside, same era.
Electric routing and concurrent flow cutting
Jonathan A. Kelner and Petar Maymounkov · 2009
Cited alongside, same era.
Mixing times and lp bounds for oblivious routing
Gregory Lawler and Hariharan Narayanan · 2009
Cited alongside, same era.
Approaching optimality for solving sdd linear systems
Ioannis Koutis, Gary L. Miller, and Richard Peng · 2010
Cited alongside, same era.
Approaching optimality for solving SDD systems
Ioannis Koutis, Gary L. Miller, and Richard Peng · 2010
Cited alongside, same era.
The multiplicative weights update method: A meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale
Cited in the paper.
Later among the works it cites.
A simple, combinatorial algorithm for solving sdd systems in nearly-linear time
Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu · 2013
Closest in time.
A New Approach to Computing Maximum Flows using Electrical Flows
Yin Tat Lee, Satish Rao, and Nikhil Srivastava · 2013
Closest in time.
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
Yin Tat Lee and Aaron Sidford · 2013
Closest in time.
Nearly maximum flows in nearly linear time
Jonah Sherman · 2013
Closest in time.