Fetching the paper…
Reading the bibliography…
We present faster approximation algorithms for generalized network flow problems.
Extensions of lipschitz mappings into a hilbert space
W.B. Johnson and J. Lindenstrauss · 1984
Earlier work this paper cites.
Solving minimum cost flow problem by successive approximation
A.V. Goldberg and R.E. Tarjan · 1987
Earlier work this paper cites.
Matching is as easy as matrix inversion
K. Mulmuley, U.V. Vazirani, and V.V. Vazirani · 1987
Earlier work this paper cites.
A faster strongly polynomial minimum cost flow algorithm
J.B. Orlin · 1988
Earlier work this paper cites.
A polynomial-time algorithm based on Newton’s method for linear programming
J. Renegar · 1988
Earlier work this paper cites.
Speeding up linear programming using fast matrix multiplication
P.M. Vaidya · 1989
Earlier work this paper cites.
Topics in Matrix Analysis
R. A. Horn and C. R. Johnson · 1991
Earlier work this paper cites.
Finding minimum-cost flows by double scaling
R.K. Ahuja, A.V. Goldberg, J.B. Orlin, and R.E. Tarjan · 1992
Earlier work this paper cites.
Network Flows
Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin · 1993
Earlier work this paper cites.
Nonnegative Matrices in the Mathematical Sciences
Abraham Berman and Robert J. Plemmons · 1994
Cited alongside, same era.
Iterative Solution Methods
Owe Axelsson · 1996
Cited alongside, same era.
Condition numbers, the barrier method, and the conjugate-gradient method
J. Renegar · 1996
Cited alongside, same era.
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
D. Goldfarb, Z. Jin, and J. Orlin · 1997
Cited alongside, same era.
Interior Point Algorithms: Theory and Analysis
Y. Ye · 1997
Cited alongside, same era.
Faster algorithms for the generalized network flow problem
T.L. Griffith, M.A. Fuller, G.B. Northcraft, and T. Radzik · 1998
Cited alongside, same era.
Simple generalized maximum flow algorithms
E. Tardos and K.D. Wayne · 1998
Later among the works it cites.
Randomness efficient identity testing of multivariate polynomials
Adam R. Klivans and Daniel A. Spielman · 2001
Later among the works it cites.
Fast and simple approximation schemes for generalized flow
L.K. Fleischer and K.D. Wayne · 2002
Later among the works it cites.
On the iterative criterion for generalized diagonally dominant matrices
Lei Li · 2002
Later among the works it cites.
Combinatorial Optimization: Polyhedra and Efficiency
Alexander Schrijver · 2003
Later among the works it cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A. Spielman and Shang-Hua Teng · 2004
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Beyond the flow decomposition barrier
A.V. Goldberg and S. Rao · 1998
Cited alongside, same era.
An iterative criterion for h-matrices
Bishan Li, Lei Li, Masunori Harada, Hiroshi Niki, and Michael J. Tsatsomeros · 1998
Cited alongside, same era.
On factor width and symmetric h-matrices
Erik G. Boman, Doron Chen, Ojas Parekh, and Sivan Toledo · 2005
Later among the works it cites.
Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
Daniel A. Spielman and Shang-Hua Teng · 2006
Later among the works it cites.