Many of Cliff Stein's publications

2018

• Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein: Resource cost aware scheduling European Journal of Operational Research 269(2): 621-632 (2018)
• Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc: Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms ICALP 2018: 7:1-7:16
• Rodrigo A. Carrasco, Kirk Pruhs, Cliff Stein, José Verschae: The Online Set Aggregation Problem LATIN 2018: 245-259
• Clifford Stein, Mingxian Zhong: Scheduling When You Don't Know the Number of Machines SODA 2018: 1261-1273
• MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein: Fast algorithms for knapsack via convolution and prediction STOC 2018: 1269-1282
• Alexandr Andoni, Clifford Stein, Zhao Song, Zhengyu Wang, Peilin Zhong: Parallel Graph Connectivity in Log Diameter Rounds CoRR abs/1805.03055 (2018)

  2017

• Jelena Marasevic, Clifford Stein, Gil Zussman: Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis Algorithmica 78(2): 521-557 (2017)
• Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein: Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing ESA 2017: 51:1-51:10
• Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, Clifford Stein: Simultaneously Load Balancing for Every p-norm, With Reassignments ITCS 2017: 51:1-51:14
• Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein: An O(Log Log m)-Competitive Algorithm for Online Machine Minimization RTSS 2017: 343-350
• Michael Huang, Clifford Stein: Extending Search Phases in the Micali-Vazirani Algorithm SEA 2017: 10:1-10:19
• Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein: An O(log log m)-competitive Algorithm for Online Machine Minimization CoRR abs/1708.09046 (2017)
• Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein: Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs CoRR abs/1711.03076 (2017)
• Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc: Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms CoRR abs/1711.06625 (2017)

  2016

• Andrei Simion, Michael Collins, Cliff Stein: Towards a Convex HMM Surrogate for Word Alignment EMNLP 2016: 531-540
• Jelena Marasevic, Clifford Stein, Gil Zussman: A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems ICALP 2016: 54:1-54:15
• Aaron Bernstein, Cliff Stein: Faster Fully Dynamic Matchings with Small Approximation Ratios SODA 2016: 692-711
• Zhen Qiu, Clifford Stein, Yuan Zhong: Experimental Analysis of Algorithms for Coflow Scheduling SEA 2016: 262-277
• Nourhan Sakr, Cliff Stein: An Empirical Study of Online Packet Scheduling Algorithms. SEA 2016: 278-293
• Aaron Bernstein, Cliff Stein: Faster Fully Dynamic Matchings with Small Approximation Ratios. SODA 2016: 692-711
• Nourhan Sakr, Cliff Stein: An Empirical Study of Online Packet Scheduling Algorithms. CoRR abs/1603.07947 (2016)
• Zhen Qiu, Cliff Stein, Yuan Zhong: Experimental Analysis of Algorithms for Coflow Scheduling. CoRR abs/1603.07981 (2016)

2015

• Andrei Arsene Simion, Michael Collins, Cliff Stein: A Family of Latent Variable Convex Relaxations for IBM Model 2. AAAI 2015: 2318-2324
• Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein: A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. PPROX-RANDOM 2015: 96-109
• Andrei Simion, Michael Collins, Cliff Stein: On A Strictly Convex IBM Model 1. EMNLP 2015: 221-226
• Aaron Bernstein, Cliff Stein: ully Dynamic Matching in Bipartite Graphs. ICALP (1) 2015: 167-179
• Zhen Qiu, Cliff Stein, Yuan Zhong: Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks. SPAA 2015: 294-303
• Jelena Marasevic, Clifford Stein, Gil Zussman: A Fast Distributed Algorithm for α-Fair Packing Problems. CoRR abs/1502.03372 (2015)
• Aaron Bernstein, Clifford Stein: Fully Dynamic Matching in Bipartite Graphs. CoRR abs/1506.07076 (2015)

2014

• Andrei Simion, Michael Collins, Cliff Stein: Some Experiments with a Convex IBM Model 2. EACL 2014: 180-184
• Jelena Marasevic, Clifford Stein, Gil Zussman: Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis. MobiHoc 2014: 367-376
• Anupam Gupta, Amit Kumar, Cliff Stein: Maintaining Assignments Online: Matching, Scheduling, and Flows. SODA 2014: 468-479
• Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein: Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA 2014: 1141-1153
• Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein: Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing. STOC 2014: 734-743
• Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein: Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing. CoRR abs/1403.6207 (2014)
• Jelena Marasevic, Cliff Stein, Gil Zussman: Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis. CoRR abs/1406.3671 (2014)

2013

• Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein: Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints. Oper. Res. Lett. 41(5): 436-441 (2013)
• Andrei Simion, Michael Collins, Cliff Stein: A Convex Alternative to IBM Model 2. EMNLP 2013: 1574-1583
• Benjamin Moseley, Kirk Pruhs, Cliff Stein: The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). IPCO 2013: 278-289
• Benjamin Moseley, Kirk Pruhs, Cliff Stein: The Complexity of Scheduling for p-norms of Flow and Stretch. CoRR abs/1301.0793 (2013)

2012

• Lukasz Jez, Fei Li, Jay Sethuraman, Clifford Stein: Online scheduling of packets with agreeable deadlines. ACM Trans. Algorithms 9(1): 5 (2012)
• Alex Sherman, Jason Nieh, Clifford Stein: FairTorrent: A Deficit-Based Distributed Algorithm to Ensure Fairness in Peer-to-Peer Systems. IEEE/ACM Trans. Netw. 20(5): 1361-1374 (2012)
• Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein: Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg 2012: 37-51

2011

• Cosmin Silvestru Negruseri, Mircea Bogdan Pacsosi, Barbara Stanley, Clifford Stein, Cristian George Strat: Solving maximum flow problems on real-world bipartite graphs. ACM Journal of Experimental Algorithmics 16 (2011)
• Garud Iyengar, David J. Phillips, Clifford Stein: Approximating Semidefinite Packing Programs. SIAM Journal on Optimization 21(1): 231-268 (2011)
• Rodrigo A. Carrasco, Garud Iyengar, Clifford Stein: Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness. CoRR abs/1110.0685 (2011)

2010

• Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina: On distributing symmetric streaming computations. ACM Trans. Algorithms 6(4) (2010)
• Kirk Pruhs, Clifford Stein: How to Schedule When You Have to Buy Your Energy. APPROX-RANDOM 2010: 352-365
• Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein: Online Stochastic Packing Applied to Display Ad Allocation. ESA (1) 2010: 182-194
• Garud Iyengar, David J. Phillips, Clifford Stein: Feasible and Accurate Algorithms for Covering Semidefinite Programs. SWAT 2010: 150-162
• Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein: Online Stochastic Ad Allocation: Efficiency and Fairness. CoRR abs/1001.5076 (2010)

2009

• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms (3. ed.). MIT Press 2009, ISBN 978-0-262-03384-8, pp. I-XIX, 1-1292
• David P. Wagner, Robert L. Scot Drysdale, Clifford Stein: An O(n^5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions. Comput. Geom. 42(5): 376-387 (2009)
• Eyjolfur Ingi Asgeirsson, Cliff Stein: Bounded-space online bin cover. J. Scheduling 12(5): 461-474 (2009)
• Nikhil Bansal, Kirk Pruhs, Clifford Stein: Speed Scaling for Weighted Flow Time. SIAM J. Comput. 39(4): 1294-1308 (2009)
• Eyjolfur Ingi Asgeirsson, Cliff Stein: Divide-and-Conquer Approximation Algorithm for Vertex Cover. SIAM J. Discrete Math. 23(3): 1261-1280 (2009)
• Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat: ALENEX 2009: 14-28
• Alex Sherman, Jason Nieh, Clifford Stein: FairTorrent: bringing fairness to peer-to-peer systems. CoNEXT 2009: 133-144
• Alex Sherman, Angelos Stavrou, Jason Nieh, Angelos D. Keromytis, Clifford Stein: Adding Trust to P2P Distribution of Paid Content. ISC 2009: 459-474

2008

• Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina: On distributing symmetric streaming computations. SODA 2008: 710-719

2007

• Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright: LP Decoding Corrects a Constant Fraction of Errors. IEEE Trans. Information Theory 53(1): 82-89 (2007)
• Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber: Non-Preemptive Min-Sum Scheduling with Resource Augmentation. FOCS 2007: 614-624
• Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein: Budget optimization in search-based advertising auctions. EC 2007: 40-49
• Fei Li, Jay Sethuraman, Clifford Stein: Better online buffer management. SODA 2007: 199-208
• Nikhil Bansal, Kirk Pruhs, Clifford Stein: Speed scaling for weighted flow time. SODA 2007: 805-813
• Garud Iyengar, David J. Phillips, Clifford Stein: Models of malicious behavior in sponsored search. SpringSim (3) 2007: 143-151
• Eyjolfur Ingi Asgeirsson, Clifford Stein: Vertex Cover Approximations on Random Graphs. WEA 2007: 285-296

2006

• Eyjólfur Ingi Ásgeirsson, Cliff Stein: Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover. ALENEX 2006: 75-85
• Bogdan Caprita, Jason Nieh, Clifford Stein: Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling. PODC 2006: 72-81
• Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina: On the Complexity of Processing Massive, Unordered, Distributed Data. CoRR abs/cs/0611108 (2006)
• Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein: Budget Optimization in Search-Based Advertising Auctions. CoRR abs/cs/0612052 (2006)

2005

• Robert L. Scot Drysdale, Clifford Stein, David P. Wagner: An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem. CCCG 2005: 97-100
• Garud Iyengar, David J. Phillips, Clifford Stein: Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring. IPCO 2005: 152-166
• Jon Feldman, Clifford Stein: LP decoding achieves capacity. SODA 2005: 460-469
• Fei Li, Jay Sethuraman, Clifford Stein: SODA 2005: 801-802
• Bogdan Caprita, Wong Chun Chan, Jason Nieh, Clifford Stein, Haoqiang Zheng: Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems. USENIX Annual Technical Conference, General Track 2005: 337-352
• Eyjolfur Ingi Asgeirsson, Clifford Stein: Vertex Cover Approximations: Experiments and Observations. WEA 2005: 545-557

2004

• David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. Math. Oper. Res. 29(3): 436-461 (2004)
• Stavros G. Kolliopoulos, Clifford Stein: Approximating disjoint-path problems using packing integer programs. Math. Program. 99(1): 63-87 (2004)
• Eyjolfur Ingi Asgeirsson, Jonathan W. Berry, Cynthia A. Phillips, David J. Phillips, Clifford Stein, Joel Wein: IPCO 2004: 116-131

• Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein: Optimal Time-Critical Scheduling via Resource Augmentation. Algorithmica 32(2): 163-200 (2002)
• April Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut: Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. SODA 2002: 723-731
• Clint Hepner, Clifford Stein: Minimizing Makespan for the Lazy Bureaucrat Problem. SWAT 2002: 40-50
• David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. CoRR cs.DS/0205051 (2002)

2001

• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company 2001, ISBN 0-262-03293-7
• Christopher Bailey-Kellogg, John J. Kelley, Clifford Stein, Bruce Randall Donald: Reducing Mass Degeneracy in SAR by MS by Stable Isotopic Labeling. Journal of Computational Biology 8(1): 19-36 (2001)
• Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein: Approximation Techniques for Average Completion Time Scheduling. SIAM J. Comput. 31(1): 146-166 (2001)
• Stavros G. Kolliopoulos, Clifford Stein: Approximation Algorithms for Single-Source Unsplittable Flow. SIAM J. Comput. 31(3): 919-946 (2001)
• Rong Xie, Daniela Rus, Clifford Stein: Scheduling multi-task multi-agent systems. Agents 2001: 159-160
• Clint Hepner, Clifford Stein: Implementation of a PTAS for Scheduling with Release Dates. ALENEX 2001: 202-215
• Clifford Stein, David P. Wagner: Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. IPCO 2001: 406-422
• Rong Xie, Daniela Rus, Clifford Stein: Scheduling Multi-task Agents. Mobile Agents 2001: 260-276

2000

• Christopher Bailey-Kellogg, John J. Kelley, Clifford Stein, Bruce Randall Donald: Reducing Mass Degeneracy in SAR by MS by Stable Isotopic Labeling. ISMB 2000: 13-24
• Javed A. Aslam, Alain Leblanc, Clifford Stein: Clustering Data without Prior Knowledge. Algorithm Engineering 2000: 74-86

1999

• Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999: 32-44
• Stavros G. Kolliopoulos, Clifford Stein: Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. IPCO 1999: 328-344
• Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young: Improved Bicriteria Existence Theorems for Scheduling. SODA 1999: 846-847
• David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. STOC 1999: 668-678

1998

• Chris Armen, Clifford Stein: A 2 2/3 Superstring Approximation Algorithm. Discrete Applied Mathematics 88(1-3): 29-57 (1998)
• Stavros G. Kolliopoulos, Clifford Stein: Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time. J. Algorithms 28(1): 125-141 (1998)
• Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein: Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. J. Comb. Optim. 1(4): 413-426 (1998)
• Cynthia A. Phillips, Clifford Stein, Joel Wein: Minimizing average completion time in the presence of release dates. Math. Program. 82: 199-223 (1998)
• Stavros G. Kolliopoulos, Clifford Stein: Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. IPCO 1998: 153-168
• Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein: An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. IPCO 1998: 338-352

1997

• Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein: Distributed Job Scheduling in Rings. J. Parallel Distrib. Comput. 45(2): 122-133 (1997)
• Clifford Stein, Joel Wein: On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Oper. Res. Lett. 21(3): 115-122 (1997)
• Cynthia A. Phillips, Clifford Stein, Joel Wein: Task Scheduling in Networks. SIAM J. Discrete Math. 10(4): 573-598 (1997)
• Stavros G. Kolliopoulos, Clifford Stein: Improved Approximation Algorithms for Unsplittable Flow Problems. FOCS 1997: 426-435
• Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein: Experimental Study of Minimum Cut Algorithms. SODA 1997: 324-333
• Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein: Approximation Techniques for Average Completion Time Scheduling. SODA 1997: 609-618
• Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein: Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract). STOC 1997: 140-149

1996

• David R. Karger, Clifford Stein: A New Approach to the Minimum Cut Problem. J. ACM 43(4): 601-640 (1996)
• Chris Armen, Clifford Stein: A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem. CPM 1996: 87-101
• Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein: Improved Scheduling Algorithms for Minsum Criteria. ICALP 1996: 646-657
• Stavros G. Kolliopoulos, Clifford Stein: Finding Real-Valued Single-Source Shortest Paths. IPCO 1996: 94-104

1995

• Chris Armen, Clifford Stein: Short Superstrings and the Structure of Overlapping Strings. Journal of Computational Biology 2(2): 307-332 (1995)
• Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Stein, Spyros Tragoudas: Fast Approximation Algorithms for Multicommodity Flow Problems. J. Comput. Syst. Sci. 50(2): 228-243 (1995)
• Cynthia A. Phillips, Clifford Stein, Joel Wein: Scheduling Jobs that Arrive Over Time (Extended Abstract). WADS 1995: 86-97
• Chris Armen, Clifford Stein: Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract). WADS 1995: 494-505

1994

• Philip N. Klein, Serge A. Plotkin, Clifford Stein, Éva Tardos: Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. SIAM J. Comput. 23(3): 466-487 (1994)
• David B. Shmoys, Clifford Stein, Joel Wein: Improved Approximation Algorithms for Shop Scheduling Problems. SIAM J. Comput. 23(3): 617-632 (1994)
• Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert Endre Tarjan: Improved Algorithms for Bipartite Network Flow. SIAM J. Comput. 23(5): 906-933 (1994)
• S. Rao Kosaraju, James K. Park, Clifford Stein: Long Tours and Short Superstrings (Preliminary Version). FOCS 1994: 166-177
• Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein: Job Scheduling in Rings. SPAA 1994: 210-219
• Cynthia A. Phillips, Clifford Stein, Joel Wein: Task Scheduling in Networks (Extended Abstract). SWAT 1994: 290-301

1993

• Philip N. Klein, Clifford Stein: A Parallel Algorithm for Approximating the Minimum Cycle Cover. Algorithmica 9(1): 23-31 (1993)
• James B. Orlin, Clifford Stein: Parallel algorithms for the assignment and minimum-cost flow problems. Oper. Res. Lett. 14(4): 181-186 (1993)
• David R. Karger, Clifford Stein: An O~(n2) algorithm for minimum cuts. STOC 1993: 757-765

1992

• Clifford Stein, Joel Wein: Approximating the Minimum-Cost Maximum Flow is P-Complete. Inf. Process. Lett. 42(6): 315-319 (1992)

1991

• Tishya Leong, Peter W. Shor, Clifford Stein: Implementation of a Combinatorial Multicommodity Flow Algorithm. Network Flows And Matching 1991: 387-406
• David B. Shmoys, Clifford Stein, Joel Wein: Improved Approximation Algorithms for Shop Scheduling Problems. SODA 1991: 148-157
• Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas: Fast Approximation Algorithms for Multicommodity Flow Problems. STOC 1991: 101-111

1990

• Philip N. Klein, Clifford Stein: A Parallel Algorithm for Eliminating Cycles in Undirected Graphs. Inf. Process. Lett. 34(6): 307-312 (1990)
• Philip N. Klein, Clifford Stein, Éva Tardos: Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities. STOC 1990: 310-321