Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew V. Goldberg
Andrew Vladislav Goldberg
Person information
- affiliation: Microsoft Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c88]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
A Local Search Algorithm for Large Maximum Weight Independent Set Problems. ESA 2022: 45:1-45:16- [i6]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems. CoRR abs/2203.15805 (2022) - 2021
- [j48]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende
, Quico Spaen:
New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. Oper. Res. Forum 2(4) (2021) - [i5]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
New instances for maximum weight independent set from a vehicle routing application. CoRR abs/2105.12623 (2021)
2010 – 2019
- 2017
- [j47]Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan:
Minimum-Cost Flows in Unit-Capacity Networks. Theory Comput. Syst. 61(4): 987-1010 (2017) - [j46]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks. Transp. Sci. 51(2): 566-591 (2017) - 2016
- [j45]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck:
Highway Dimension and Provably Efficient Shortest Path Algorithms. J. ACM 63(5): 41:1-41:26 (2016) - [j44]Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan:
Algorithms for Hub Label Optimization. ACM Trans. Algorithms 13(1): 16:1-16:17 (2016) - [c87]Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. SODA 2016: 740-753 - [p1]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. Algorithm Engineering 2016: 19-80 - [e3]Andrew V. Goldberg, Alexander S. Kulikov:
Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings. Lecture Notes in Computer Science 9685, Springer 2016, ISBN 978-3-319-38850-2 [contents] - [r3]Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Hub Labeling (2-Hop Labeling). Encyclopedia of Algorithms 2016: 932-938 - [r2]Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2016: 947-951 - 2015
- [j43]Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck:
An exact combinatorial algorithm for minimum graph bisection. Math. Program. 153(2): 417-458 (2015) - [c86]Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck:
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. ESA 2015: 619-630 - [c85]Daniel Delling, Andrew V. Goldberg, Moisés Goldszmidt, John Krumm, Kunal Talwar, Renato F. Werneck:
Navigation made personal: inferring driving preferences from GPS traces. SIGSPATIAL/GIS 2015: 31:1-31:9 - [c84]Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) 2015: 62-74 - [c83]Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan:
Minimum Cost Flows in Graphs with Unit Capacities. STACS 2015: 406-419 - [i4]Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling. CoRR abs/1501.02492 (2015) - [i3]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. CoRR abs/1504.05140 (2015) - 2014
- [j42]Andrew V. Goldberg, Robert Endre Tarjan:
Efficient maximum flow algorithms. Commun. ACM 57(8): 82-89 (2014) - [c82]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Robust Distance Queries on Massive Networks. ESA 2014: 321-333 - [c81]Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck:
Hub Labels: Theory and Practice. SEA 2014: 259-270 - 2013
- [j41]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013) - [j40]Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck:
PHAST: Hardware-accelerated shortest path trees. J. Parallel Distributed Comput. 73(7): 940-952 (2013) - [c80]Edith Cohen, Daniel Delling, Fabian Fuchs, Andrew V. Goldberg, Moisés Goldszmidt, Renato F. Werneck:
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths. COSN 2013: 131-142 - [c79]Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan:
Algorithms for Hub Label Optimization. ICALP (1) 2013: 69-80 - [c78]Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko:
Separating Hierarchical and General Hub Labelings. MFCS 2013: 469-479 - [c77]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks (Extended Abstract). SOCS 2013 - [c76]Andrew V. Goldberg:
The Hub Labeling Algorithm. SEA 2013: 4 - [c75]Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Hub Label Compression. SEA 2013: 18-29 - [i2]Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko:
Separating Hierarchical and General Hub Labelings. CoRR abs/1304.5973 (2013) - [i1]Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner:
Algorithm Engineering (Dagstuhl Seminar 13391). Dagstuhl Reports 3(9): 169-189 (2013) - 2012
- [c74]Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck:
Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX 2012: 30-44 - [c73]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Hierarchical Hub Labelings for Shortest Paths. ESA 2012: 24-35 - [c72]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
HLDB: location-based services in databases. SIGSPATIAL/GIS 2012: 339-348 - 2011
- [j39]Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan:
Derandomization of auctions. Games Econ. Behav. 72(1): 1-11 (2011) - [j38]Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Shortest Paths in Road Networks: From Practice to Theory and Back. it Inf. Technol. 53(6): 294-301 (2011) - [c71]Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Faster Batched Shortest Paths in Road Networks. ATMOS 2011: 52-63 - [c70]Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Maximum Flows by Incremental Breadth-First Search. ESA 2011: 457-468 - [c69]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
VC-Dimension and Shortest Path Algorithms. ICALP (1) 2011: 690-699 - [c68]Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck:
PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS 2011: 921-931 - [c67]Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck:
Graph Partitioning with Natural Cuts. IPDPS 2011: 1135-1146 - [c66]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. SEA 2011: 230-241 - [c65]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck:
Customizable Route Planning. SEA 2011: 376-387 - 2010
- [c64]Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA 2010: 782-793 - [c63]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Alternative Routes in Road Networks. SEA 2010: 23-34
2000 – 2009
- 2009
- [j37]Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Shortest-path feasibility algorithms: An experimental evaluation. ACM J. Exp. Algorithmics 14 (2009) - [c62]Andrew V. Goldberg:
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem. AAIM 2009: 212-225 - [c61]Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX 2009: 1-13 - [c60]Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew V. Goldberg:
Quincy: fair scheduling for distributed computing clusters. SOSP 2009: 261-276 - [e2]Andrew V. Goldberg, Yunhong Zhou:
Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings. Lecture Notes in Computer Science 5564, Springer 2009, ISBN 978-3-642-02157-2 [contents] - [e1]Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 13-14, 2006. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74, DIMACS/AMS 2009, ISBN 978-0-8218-4383-3 [contents] - 2008
- [j36]Andrew V. Goldberg:
A Practical Shortest Path Algorithm with Linear Expected Time. SIAM J. Comput. 37(5): 1637-1655 (2008) - [c59]Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Shortest Path Feasibility Algorithms: An Experimental Evaluation. ALENEX 2008: 118-132 - [c58]Andrew V. Goldberg:
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem. ESA 2008: 466-477 - [r1]Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2008 - 2007
- [c57]Andrew V. Goldberg:
Point-to-Point Shortest Path Algorithms with Preprocessing. SOFSEM (1) 2007: 88-102 - [c56]Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck:
Better Landmarks Within Reach. WEA 2007: 38-51 - [c55]Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou:
Experimental Evaluation of Parametric Max-Flow Algorithms. WEA 2007: 256-269 - 2006
- [j35]Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks, Andrew Wright:
Competitive auctions. Games Econ. Behav. 55(2): 242-269 (2006) - [c54]Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck:
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. ALENEX 2006: 129-143 - [c53]Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck:
Reach for A*: Shortest Path Algorithms with Preprocessing. The Shortest Path Problem 2006: 93-139 - [c52]Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi:
Routing in Networks with Low Doubling Dimension. ICDCS 2006: 75 - 2005
- [c51]Andrew V. Goldberg, Renato Fonseca F. Werneck:
Computing Point-to-Point Shortest Paths from External Memory. ALENEX/ANALCO 2005: 26-40 - [c50]Andrew V. Goldberg, Chris Harrelson:
Computing the shortest path: A search meets graph theory. SODA 2005: 156-165 - [c49]Andrew V. Goldberg, Jason D. Hartline:
Collusion-resistant mechanisms for single-parameter agents. SODA 2005: 620-629 - [c48]Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan:
Derandomization of auctions. STOC 2005: 619-625 - 2004
- [j34]Andrew V. Goldberg, Alexander V. Karzanov:
Maximum skew-symmetric flows and matchings. Math. Program. 100(3): 537-568 (2004) - [c47]Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks:
A Lower Bound on the Competitive Ratio of Truthful Auctions. STACS 2004: 644-655 - 2003
- [c46]Cynthia Dwork, Andrew V. Goldberg, Moni Naor:
On Memory-Bound Functions for Fighting Spam. CRYPTO 2003: 426-444 - [c45]Andrew V. Goldberg, Jason D. Hartline:
Envy-free auctions for digital goods. EC 2003: 29-35 - [c44]Andrew V. Goldberg, Jason D. Hartline:
Competitiveness via consensus. SODA 2003: 215-222 - 2002
- [c43]Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin:
Truthful and Competitive Double Auctions. ESA 2002: 361-373 - [c42]Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin:
Competitive generalized auctions. STOC 2002: 72-81 - 2001
- [j33]Andrew V. Goldberg, Kostas Tsioutsiouliklis:
Cut Tree Algorithms: An Experimental Study. J. Algorithms 38(1): 51-83 (2001) - [c41]Andrew V. Goldberg:
A Simple Shortest Path Algorithm with Linear Average Time. ESA 2001: 230-241 - [c40]Andrew V. Goldberg, Jason D. Hartline:
Competitive Auctions for Multiple Digital Goods. ESA 2001: 416-427 - [c39]Andrew V. Goldberg:
Shortest Path Algorithms: Engineering Aspects. ISAAC 2001: 502-513 - [c38]Andrew V. Goldberg, Jason D. Hartline, Andrew Wright:
Competitive auctions and digital goods. SODA 2001: 735-744
1990 – 1999
- 1999
- [j32]Boris V. Cherkassky, Andrew V. Goldberg:
Negative-cycle detection algorithms. Math. Program. 85(2): 277-311 (1999) - [j31]Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein:
Buckets, Heaps, Lists, and Monotone Priority Queues. SIAM J. Comput. 28(4): 1326-1346 (1999) - [j30]Andrew V. Goldberg, Satish Rao:
Flows in Undirected Unit Capacity Networks. SIAM J. Discret. Math. 12(1): 1-5 (1999) - [c37]Andrew V. Goldberg, Craig Silverstein:
Computational evaluation of hot queues. Data Structures, Near Neighbor Searches, and Methodology 1999: 49-67 - [c36]Yuan Chen, Jan Edler, Andrew V. Goldberg, Allan Gottlieb, Sumeet Sobti, Peter N. Yianilos:
A Prototype Implementation of Archival Intermemory. ACM DL 1999: 28-37 - [c35]Andrew V. Goldberg, Kostas Tsioutsiouliklis:
Cut Tree Algorithms. SODA 1999: 376-385 - [c34]Andrew V. Goldberg, Bernard M. E. Moret:
Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. SODA 1999: 913-914 - [c33]Andrew V. Goldberg:
Selecting Problems for Algorithm Evaluation. WAE 1999: 1-11 - 1998
- [j29]Andrew V. Goldberg, Satish Rao:
Beyond the Flow Decomposition Barrier. J. ACM 45(5): 783-797 (1998) - [j28]Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin:
Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms. ACM J. Exp. Algorithmics 3: 8 (1998) - [c32]Andrew V. Goldberg, Peter N. Yianilos:
Towards an Archival Intermemory. ADL 1998: 147-156 - [c31]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 - [c30]Andrew V. Goldberg:
Recent Developments in Maximum Flow Algorithms (Invited Lecture). SWAT 1998: 1-10 - 1997
- [j27]Boris V. Cherkassky, Andrew V. Goldberg:
On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19(4): 390-410 (1997) - [j26]Andrew V. Goldberg:
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm. J. Algorithms 22(1): 1-29 (1997) - [j25]Andrew V. Goldberg, Alexander V. Karzanov:
Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost. Math. Oper. Res. 22(1): 90-109 (1997) - [j24]Andrew V. Goldberg, Robert Kennedy:
Global Price Updates Help. SIAM J. Discret. Math. 10(4): 551-572 (1997) - [j23]Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys:
Strategic directions in research in theory of computing. SIGACT News 28(3): 75-93 (1997) - [c29]Andrew V. Goldberg, Satish Rao:
Beyond the Flow Decomposition Barrier. FOCS 1997: 2-11 - [c28]Andrew V. Goldberg, Satish Rao:
Flows in Undirected Unit Capacity Networks. FOCS 1997: 32-34 - [c27]Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein:
Buckets, Heaps, Lists, and Monotone Priority Queues. SODA 1997: 83-92 - [c26]Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein:
Experimental Study of Minimum Cut Algorithms. SODA 1997: 324-333 - [c25]Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin, João C. Setubal, Jorge Stolfi:
Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms. WAE 1997: 1-10 - 1996
- [j22]Andrew V. Goldberg, Alexander V. Karzanov:
Path Problems in Skew-Symmetric Graphs. Comb. 16(3): 353-382 (1996) - [j21]Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik:
Shortest paths algorithms: Theory and experimental evaluation. Math. Program. 73: 129-174 (1996) - [c24]Boris V. Cherkassky, Andrew V. Goldberg:
Negative-Cycle Detection Algorithms. ESA 1996: 349-363 - 1995
- [j20]Andrew V. Goldberg, Robert Kennedy:
An efficient cost scaling algorithm for the assignment problem. Math. Program. 71: 153-177 (1995) - [j19]Andrew V. Goldberg:
Scaling Algorithms for the Shortest Paths Problem. SIAM J. Comput. 24(3): 494-504 (1995) - [c23]Andrew V. Goldberg, Alexander V. Karzanov:
Maximum Skew-Symmetric Flows. ESA 1995: 155-170 - [c22]Boris V. Cherkassky, Andrew V. Goldberg:
On Implementing Push-Relabel Method for the Maximum Flow Problem. IPCO 1995: 157-171 - 1994
- [j18]Tomasz Radzik, Andrew V. Goldberg:
Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. Algorithmica 11(3): 226-242 (1994) - [j17]Andrew V. Goldberg, Bruce M. Maggs, Serge A. Plotkin:
A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches. IEEE Trans. Computers 43(3): 321-326 (1994) - [c21]Andrew V. Goldberg:
Optimization Algorithms For Large Networks. ESA 1994: 1-9 - [c20]Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson:
Improved Approximation Algorithms for Network Design Problems. SODA 1994: 223-232 - [c19]Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik:
Shortest Paths Algorithms: Theory and Experimental Evaluation. SODA 1994: 516-525 - [c18]Andrew V. Goldberg, Alexander V. Karzanov:
Path Problems in Skew-Symmetric Graphs. SODA 1994: 526-535 - 1993
- [j16]Ted Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin:
Approximating Matchings in Parallel. Inf. Process. Lett. 46(3): 115-118 (1993) - [j15]Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems. J. Algorithms 14(2): 180-213 (1993) - [c17]Andrew V. Goldberg:
An efficient implementation of a scaling minimum-cost flow algorithm. IPCO 1993: 251-266 - [c16]Andrew V. Goldberg:
Scaling Algorithms for the Shortest Paths Problem. SODA 1993: 222-231 - 1992
- [j14]Andrew V. Goldberg:
A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms. Inf. Process. Lett. 42(5): 249-256 (1992) - [j13]Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert Endre Tarjan:
Finding minimum-cost flows by double scaling. Math. Program. 53: