Experimental evaluation of a parametric flow algorithm (2006)

by Maxim A. Babenko , Andrew V. Goldberg
Citations:7 - 3 self

Active Bibliography

4 Polynomial time algorithms for ratio regions and a variant of normalized cut – Dorit S. Hochbaum
6 Experimental evaluation of parametric max-flow algorithms – Maxim Babenko, Jonathan Derryberry, Andrew Goldberg, Robert Tarjan, Yunhong Zhou - 2007
4 Balancing applied to maximum network flow problems – Robert Tarjan, Julie Ward, Bin Zhang, Yunhong Zhou, Jia Mao - 2006
44 Improved Algorithms For Bipartite Network Flow – Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert E. Tarjan - 1994
1 MAX-DENSITY Revisited: A Generalization and A More Efficient Algorithm – George F. Georgakopoulos, Kostas Politopoulos - 2007
4 Local Density – Sven Kosub - 2004
5 A New Property And A Faster Algorithm For Baseball Elimination – Kevin D. Wayne - 1999
Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging Part I: Normalized cut and ratio regions – Dorit S. Hochbaum - 2008
NETWORK REINFORCEMENT – Francisco Barahona
1 Clustering Methods Based on Minimum-Cut Trees – Gary Flake, Robert Tarjan, Kostas Tsioutsiouliklis - 2002
Solving Maximum Flow Problems on Real World Bipartite Graphs – Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat
Vision, Perception and Multimedia Understanding – Julien Mairal, Rodolphe Jenatton, Guillaume Obozinski, Francis Bach, Julien Mairal, Rodolphe Jenatton, Guillaume Obozinski, Francis Bach, Équipe-projet Willow - 2010
Network FlowAlgorithms for StructuredSparsity – Julien Mairal, Guillaume Obozinski, Rodolphe Jenatton, Francis Bach
Solving Maximum Flow Problems on Real World Bipartite Graphs – Cosmin Silvestru, Barbara Stanley, Clifford Stein, Cristian George Strat
10 Length Functions for Flow Computations – Andrew V. Goldberg, Satish Rao - 1997
1 COMPUTATIONAL IMPROVEMENTS IN THE SUBSTITUTION METHOD FOR BOUNDING PERCOLATION THRESHOLDS – William D. May - 2005
53 Graph clustering and minimum cut trees – Gary William Flake, Robert E. Tarjan, Kostas Tsioutsiouliklis - 2004
2 Rapidly Solving an Online Sequence of Maximum Flow Problems,” in preparation – Doug Altner, Özlem Ergun - 2008
Rice CAAM TR07-09: a preliminary version Parametric Maximum Flow Algorithms for Fast Total Variation Minimization – Donald Goldfarb, Wotao Yin - 2007