×

Goldberg, Andrew V.

Author ID: goldberg.andrew-v Recent zbMATH articles by "Goldberg, Andrew V."
Published as: Goldberg, Andrew V.; Goldberg, A. V.; Goldberg, Andrew
External Links: MGP

Publications by Year

Citations contained in zbMATH Open

90 Publications have been cited 1,815 times in 1,342 Documents Cited by Year
A new approach to the maximum-flow problem. Zbl 0661.90031
Goldberg, Andrew V.; Tarjan, Robert E.
311
1988
Beyond the flow decomposition barrier. Zbl 1064.90567
Goldberg, Andrew V.; Rao, Satish
100
1998
Finding minimum-cost circulations by successive approximation. Zbl 0727.90024
Goldberg, Andrew V.; Tarjan, Robert E.
87
1990
Improved approximation algorithms for network design problems. Zbl 0873.68005
Goemans, M. X.; Goldberg, A. V.; Plotkin, S.; Shmoys, D. B.; Tardos, É.; Williamson, D. P.
86
1994
Shortest paths algorithms: Theory and experimental evaluation. Zbl 0853.90111
Cherkassky, Boris V.; Goldberg, Andrew V.; Radzik, Tomasz
83
1996
Parallel symmetry-breaking in sparse graphs. Zbl 0671.05038
Goldberg, Andrew V.; Plotkin, Serge A.; Shannon, Gregory E.
82
1988
Finding minimum-cost circulations by cancelling negative cycles. Zbl 0697.68063
Goldberg, Andrew V.; Tarjan, Robert E.
75
1989
On implementing the push-relabel method for the maximum flow problem. Zbl 0898.68029
Cherkassky, B. V.; Goldberg, A. V.
69
1997
Competitive auctions. Zbl 1125.91041
Goldberg, Andrew V.; Hartline, Jason D.; Karlin, Anna R.; Saks, Michael; Wright, Andrew
53
2006
Computing the shortest path: \(A^\ast\) search meets graph theory. Zbl 1297.05230
Goldberg, Andrew V.; Harrelson, Chris
50
2005
Scaling algorithms for the shortest paths problem. Zbl 0831.68046
Goldberg, Andrew V.
41
1995
Highway dimension, shortest paths, and provably efficient algorithms. Zbl 1288.68243
Abraham, Ittai; Fiat, Amos; Goldberg, Andrew V.; Werneck, Renato F.
40
2010
Competitive auctions and digital goods. Zbl 0988.91024
Goldberg, Andrew V.; Hartline, Jason D.; Wright, Andrew
36
2001
Finding minimum-cost flows by double scaling. Zbl 0761.90036
Ahuja, Ravindra K.; Goldberg, Andrew V.; Orlin, James B.; Tarjan, Robert E.
31
1992
Network flow algorithms. Zbl 0728.90035
Goldberg, Andrew V.; Tardos, Éva; Tarjan, Robert E.
31
1990
Maximum skew-symmetric flows and matchings. Zbl 1070.90090
Goldberg, Andrew V.; Karzanov, Alexander V.
27
2004
Negative-cycle detection algorithms. Zbl 0954.90057
Cherkassky, Boris V.; Goldberg, Andrew V.
25
1999
VC-dimension and shortest path algorithms. Zbl 1334.05161
Abraham, Ittai; Delling, Daniel; Fiat, Amos; Goldberg, Andrew V.; Werneck, Renato F.
23
2011
Hierarchical hub labelings for shortest paths. Zbl 1365.05270
Abraham, Ittai; Delling, Daniel; Goldberg, Andrew V.; Werneck, Renato F.
22
2012
Collusion-resistant mechanisms for single-parameter agents. Zbl 1297.91079
Goldberg, Andrew V.; Hartline, Jason D.
21
2005
Combinatorial algorithms for the generalized circulation problem. Zbl 0734.90029
Goldberg, Andrew V.; Plotkin, Serge A.; Tardos, Éva
21
1991
Highway dimension and provably efficient shortest path algorithms. Zbl 1425.68447
Abraham, Ittai; Delling, Daniel; Fiat, Amos; Goldberg, Andrew V.; Werneck, Renato F.
21
2016
On memory-bound functions for fighting spam. Zbl 1122.94415
Dwork, Cynthia; Goldberg, Andrew; Naor, Moni
20
2003
Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Zbl 0743.90107
Goldberg, Andrew V.; Grigoriadis, Michael D.; Tarjan, Robert E.
19
1991
Competitive generalized auctions. Zbl 1192.91103
Fiat, Amos; Goldberg, Andrew V.; Hartline, Jason D.; Karlin, Anna R.
18
2002
Buckets, heaps, lists, and monotone priority queues. Zbl 0926.68092
Cherkassky, Boris V.; Goldberg, Andrew V.; Silverstein, Craig
18
1999
An efficient cost scaling algorithm for the assignment problem. Zbl 0846.90118
Goldberg, Andrew V.; Kennedy, Robert
18
1995
Derandomization of auctions. Zbl 1192.91095
Aggarwal, Gagan; Fiat, Amos; Goldberg, Andrew V.; Hartline, Jason D.; Immorlica, Nicole; Sudan, Madhu
14
2005
Experimental study of minimum cut algorithms. Zbl 1321.05254
Chekuri, Chandra S.; Goldberg, Andrew V.; Karger, David R.; Levine, Matthew S.; Stein, Cliff
14
1997
Compression and ranking. Zbl 0738.68048
Goldberg, Andrew V.; Sipser, Michael
13
1991
Robust distance queries on massive networks. Zbl 1423.68332
Delling, Daniel; Goldberg, Andrew V.; Pajor, Thomas; Werneck, Renato F.
13
2014
The shortest path problem. Ninth DIMACS implementation challenge, Piscataway, NJ, USA, November 13–14, 2006. Proceedings. Zbl 1172.05005
13
2009
Parallel \((\Delta +1)\)-coloring of constant-degree graphs. Zbl 0653.68068
Goldberg, Andrew V.; Plotkin, Serge A.
12
1987
Exact combinatorial branch-and-bound for graph bisection. Zbl 1430.68192
Delling, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.
12
2012
Path problems in skew-symmetric graphs. Zbl 0867.05037
Goldberg, Andrew V.; Karzanov, Alexander V.
11
1996
Sublinear-time parallel algorithms for matching and related problems. Zbl 0769.68034
Goldberg, Andrew V.; Plotkin, Serge A.; Vaidya, Pravin M.
11
1993
Approximating matchings in parallel. Zbl 0784.68065
Fischer, Ted; Goldberg, Andrew V.; Haglin, David J.; Plotkin, Serge
11
1993
An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow. Zbl 0911.90153
Goldberg, Andrew V.; Oldham, Jeffrey D.; Plotkin, Serge; Stein, Cliff
11
1998
Graph algorithms. Edited by Guy Even. With a foreword by Richard M. Karp. 2nd ed. Zbl 1237.05199
Even, Shimon
11
2012
On implementing push-relabel method for the maximum flow problem. Zbl 1498.90237
Cherkassky, Boris V.; Goldberg, Andrew V.
10
1995
A heuristic improvement of the Bellman-Ford algorithm. Zbl 0771.68091
Goldberg, Andrew V.; Radzik, Tomasz
9
1993
Scaling algorithms for the shortest paths problem. Zbl 0801.68132
Goldberg, Andrew V.
9
1993
Tight bounds on the number of minimum-mean cycle cancellations and related results. Zbl 0795.68098
Radzik, Tomasz; Goldberg, Andrew V.
9
1994
Augment or push? {A} computational study of bipartite matching and unit capacity flow algorithms. Zbl 1073.68903
Cherkassky, Boris V.; Goldberg, Andrew V.; Martin, Paul; Setubal, João C.; Stolfi, Jorge
9
1998
Cut tree algorithms: An experimental study. Zbl 0969.68178
Goldberg, Andrew V.; Tsioutsiouliklis, Kostas
9
2001
Reach for \(A^\ast\): efficient point-to-point shortest path algorithms. Zbl 1428.68215
Goldberg, Andrew V.; Kaplan, Haim; Werneck, Renato F.
9
2006
Shortest-path feasibility algorithms, an experimental evaluation. Zbl 1284.05275
Cherkassky, Boris V.; Georgiadis, Loukas; Goldberg, Andrew V.; Tarjan, Robert E.; Werneck, Renato F.
8
2009
Competitiveness via consensus. Zbl 1094.68517
Goldberg, Andrew V.; Hartline, Jason D.
8
2003
Shortest paths algorithms: Theory and experimental evaluation. Zbl 0867.90114
Cherkassky, Boris V.; Goldberg, Andrew V.; Radzik, Tomasz
7
1994
Scaling methods for finding a maximum free multiflow of minimum cost. Zbl 0871.90030
Goldberg, Andrew V.; Karzanov, Alexander V.
7
1997
Global price updates help. Zbl 0891.90162
Goldberg, Andrew V.; Kennedy, Robert
7
1997
A simple shortest path algorithm with linear average time. Zbl 1007.05088
Goldberg, Andrew V.
7
2001
The partial augment-relabel algorithm for the maximum flow problem. Zbl 1158.90413
Goldberg, Andrew V.
7
2008
Point-to-point shortest path algorithms with preprocessing. Zbl 1131.68523
Goldberg, Andrew V.
7
2007
An experimental study of minimum mean cycle algorithms. Zbl 1430.68209
Georgiadis, Loukas; Goldberg, Andrew V.; Tarjan, Robert E.; Werneck, Renato F.
7
2009
Using interior-point methods for fast parallel algorithms for bipartite matching and related problems. Zbl 0743.68074
Goldberg, Andrew V.; Plotkin, Serge A.; Shmoys, David B.; Tardos, Eva
6
1992
Truthful and competitive double auctions. Zbl 1046.91046
Deshmukh, Kaustubh; Goldberg, Andrew V.; Hartline, Jason D.; Karlin, Anna R.
6
2002
Shortest path algorithms: engineering aspects. Zbl 1077.68728
Goldberg, Andrew V.
6
2001
Maximum flows by incremental breadth-first search. Zbl 1346.68220
Goldberg, Andrew V.; Hed, Sagi; Kaplan, Haim; Tarjan, Robert E.; Werneck, Renato F.
6
2011
An exact combinatorial algorithm for minimum graph bisection. Zbl 1327.90255
Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.
6
2015
Reach for \(A^*\): shortest path algorithms with preprocessing. Zbl 1204.90112
Goldberg, Andrew V.; Kaplan, Haim; Werneck, Renato F.
6
2009
On dynamic approximate shortest paths for planar graphs with worst-case costs. Zbl 1410.68266
Abraham, Ittai; Chechik, Shiri; Delling, Daniel; Goldberg, Andrew V.; Werneck, Renato F.
6
2016
A natural randomization strategy for multicommodity flow and related algorithms. Zbl 0773.90026
Goldberg, Andrew V.
5
1992
Processor-efficient implementation of a maximum flow algorithm. Zbl 0754.90024
Goldberg, Andrew V.
5
1991
Negative-cycle detection algorithms. Zbl 1379.68254
Cherkassky, Boris V.; Goldberg, Andrew V.
5
1996
Flows in undirected unit capacity networks. Zbl 0918.90067
Goldberg, Andrew V.; Rao, Satish
4
1999
On implementing scaling push-relabel algorithms for the minimum-cost flow problem. Zbl 0787.90021
Goldberg, Andrew V.; Kharitonov, Michael
4
1993
Derandomization of auctions. Zbl 1236.91072
Aggarwal, Gagan; Fiat, Amos; Goldberg, Andrew V.; Hartline, Jason D.; Immorlica, Nicole; Sudan, Madhu
4
2011
On the complexity of hub labeling (extended abstract). Zbl 1465.68054
Babenko, Maxim; Goldberg, Andrew V.; Kaplan, Haim; Savchenko, Ruslan; Weller, Mathias
4
2015
Alternative routes in road networks. Zbl 1322.05127
Abraham, Ittai; Delling, Daniel; Goldberg, Andrew V.; Werneck, Renato F.
4
2013
Minimum-cost flows in unit-capacity networks. Zbl 1379.05049
Goldberg, Andrew V.; Hed, Sagi; Kaplan, Haim; Tarjan, Robert E.
4
2017
Implementations of Dijkstra’s algorithm based on multi-level buckets. Zbl 0898.90128
Goldberg, Andrew V.; Silverstein, Craig
3
1997
Cut tree algorithms. Zbl 0938.68071
Goldberg, Andrew V.; Tsioutsiouliklis, Kostas
3
1999
Algorithms for hub label optimization. Zbl 1336.68287
Babenko, Maxim; Goldberg, Andrew V.; Gupta, Anupam; Nagarajan, Viswanath
3
2013
Faster and more dynamic maximum flow by incremental breadth-first search. Zbl 1466.68091
Goldberg, Andrew V.; Hed, Sagi; Kaplan, Haim; Kohli, Pushmeet; Tarjan, Robert E.; Werneck, Renato F.
3
2015
A practical shortest path algorithm with linear expected time. Zbl 1225.68275
Goldberg, Andrew V.
3
2008
A lower bound on the competitive ratio of truthful auctions. Zbl 1122.91322
Goldberg, Andrew V.; Hartline, Jason D.; Karlin, Anna R.; Saks, Michael
3
2004
Minimum cost flows in graphs with unit capacities. Zbl 1356.05063
Goldberg, Andrew V.; Kaplan, Haim; Hed, Sagi; Tarjan, Robert E.
3
2015
Experimental algorithms. 15th international symposium, SEA 2016, St. Petersburg, Russia, June 5–8, 2016. Proceedings. Zbl 1337.68010
3
2016
Recent developments in maximum flow algorithms (invited lecture). Zbl 1502.90182
Goldberg, Andrew V.
3
1998
Maximum skew-symmetric flows. Zbl 1512.90236
Goldberg, Andrew V.; Karzanov, Alexander V.
3
1995
Competitive auctions for multiple digital goods. Zbl 1037.91036
Goldberg, Andrew V.; Hartline, Jason D.
2
2001
Separating hierarchical and general hub labelings. Zbl 1398.68397
Goldberg, Andrew V.; Razenshteyn, Ilya; Savchenko, Ruslan
2
2013
An efficient implementation of a scaling minimum-cost flow algorithm. Zbl 0924.90061
Goldberg, Andrew V.
2
1993
Path problems in skew-symmetric graphs. Zbl 0867.90118
Goldberg, Andrew V.; Karzanov, Alexander V.
1
1994
Tight bounds on the number of minimum-mean cycle cancellations and related results. Zbl 0800.68644
Radzik, Tomasz; Goldberg, Andrew V.
1
1991
A parallel algorithm for finding a blocking flow in an acyclic network. Zbl 0688.68034
Goldberg, Andrew V.; Tarjan, Robert E.
1
1989
Buckets, heaps, lists, and monotone priority queues. Zbl 1321.68217
Cherkassky, Boris V.; Goldberg, Andrew V.; Silverstein, Craig
1
1997
Shortest path feasibility algorithms: an experimental evaluation. Zbl 1427.68351
Cherkassky, Boris V.; Georgiadis, Loukas; Goldberg, Andrew V.; Tarjan, Robert E.; Werneck, Renato F.
1
2008
Algorithms for hub label optimization. Zbl 1446.68194
Babenko, Maxim; Goldberg, Andrew V.; Gupta, Anupam; Nagarajan, Viswanath
1
2016
Minimum-cost flows in unit-capacity networks. Zbl 1379.05049
Goldberg, Andrew V.; Hed, Sagi; Kaplan, Haim; Tarjan, Robert E.
4
2017
Highway dimension and provably efficient shortest path algorithms. Zbl 1425.68447
Abraham, Ittai; Delling, Daniel; Fiat, Amos; Goldberg, Andrew V.; Werneck, Renato F.
21
2016
On dynamic approximate shortest paths for planar graphs with worst-case costs. Zbl 1410.68266
Abraham, Ittai; Chechik, Shiri; Delling, Daniel; Goldberg, Andrew V.; Werneck, Renato F.
6
2016
Experimental algorithms. 15th international symposium, SEA 2016, St. Petersburg, Russia, June 5–8, 2016. Proceedings. Zbl 1337.68010
3
2016
Algorithms for hub label optimization. Zbl 1446.68194
Babenko, Maxim; Goldberg, Andrew V.; Gupta, Anupam; Nagarajan, Viswanath
1
2016
An exact combinatorial algorithm for minimum graph bisection. Zbl 1327.90255
Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.
6
2015
On the complexity of hub labeling (extended abstract). Zbl 1465.68054
Babenko, Maxim; Goldberg, Andrew V.; Kaplan, Haim; Savchenko, Ruslan; Weller, Mathias
4
2015
Faster and more dynamic maximum flow by incremental breadth-first search. Zbl 1466.68091
Goldberg, Andrew V.; Hed, Sagi; Kaplan, Haim; Kohli, Pushmeet; Tarjan, Robert E.; Werneck, Renato F.
3
2015
Minimum cost flows in graphs with unit capacities. Zbl 1356.05063
Goldberg, Andrew V.; Kaplan, Haim; Hed, Sagi; Tarjan, Robert E.
3
2015
Robust distance queries on massive networks. Zbl 1423.68332
Delling, Daniel; Goldberg, Andrew V.; Pajor, Thomas; Werneck, Renato F.
13
2014
Alternative routes in road networks. Zbl 1322.05127
Abraham, Ittai; Delling, Daniel; Goldberg, Andrew V.; Werneck, Renato F.
4
2013
Algorithms for hub label optimization. Zbl 1336.68287
Babenko, Maxim; Goldberg, Andrew V.; Gupta, Anupam; Nagarajan, Viswanath
3
2013
Separating hierarchical and general hub labelings. Zbl 1398.68397
Goldberg, Andrew V.; Razenshteyn, Ilya; Savchenko, Ruslan
2
2013
Hierarchical hub labelings for shortest paths. Zbl 1365.05270
Abraham, Ittai; Delling, Daniel; Goldberg, Andrew V.; Werneck, Renato F.
22
2012
Exact combinatorial branch-and-bound for graph bisection. Zbl 1430.68192
Delling, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.
12
2012
Graph algorithms. Edited by Guy Even. With a foreword by Richard M. Karp. 2nd ed. Zbl 1237.05199
Even, Shimon
11
2012
VC-dimension and shortest path algorithms. Zbl 1334.05161
Abraham, Ittai; Delling, Daniel; Fiat, Amos; Goldberg, Andrew V.; Werneck, Renato F.
23
2011
Maximum flows by incremental breadth-first search. Zbl 1346.68220
Goldberg, Andrew V.; Hed, Sagi; Kaplan, Haim; Tarjan, Robert E.; Werneck, Renato F.
6
2011
Derandomization of auctions. Zbl 1236.91072
Aggarwal, Gagan; Fiat, Amos; Goldberg, Andrew V.; Hartline, Jason D.; Immorlica, Nicole; Sudan, Madhu
4
2011
Highway dimension, shortest paths, and provably efficient algorithms. Zbl 1288.68243
Abraham, Ittai; Fiat, Amos; Goldberg, Andrew V.; Werneck, Renato F.
40
2010
The shortest path problem. Ninth DIMACS implementation challenge, Piscataway, NJ, USA, November 13–14, 2006. Proceedings. Zbl 1172.05005
13
2009
Shortest-path feasibility algorithms, an experimental evaluation. Zbl 1284.05275
Cherkassky, Boris V.; Georgiadis, Loukas; Goldberg, Andrew V.; Tarjan, Robert E.; Werneck, Renato F.
8
2009
An experimental study of minimum mean cycle algorithms. Zbl 1430.68209
Georgiadis, Loukas; Goldberg, Andrew V.; Tarjan, Robert E.; Werneck, Renato F.
7
2009
Reach for \(A^*\): shortest path algorithms with preprocessing. Zbl 1204.90112
Goldberg, Andrew V.; Kaplan, Haim; Werneck, Renato F.
6
2009
The partial augment-relabel algorithm for the maximum flow problem. Zbl 1158.90413
Goldberg, Andrew V.
7
2008
A practical shortest path algorithm with linear expected time. Zbl 1225.68275
Goldberg, Andrew V.
3
2008
Shortest path feasibility algorithms: an experimental evaluation. Zbl 1427.68351
Cherkassky, Boris V.; Georgiadis, Loukas; Goldberg, Andrew V.; Tarjan, Robert E.; Werneck, Renato F.
1
2008
Point-to-point shortest path algorithms with preprocessing. Zbl 1131.68523
Goldberg, Andrew V.
7
2007
Competitive auctions. Zbl 1125.91041
Goldberg, Andrew V.; Hartline, Jason D.; Karlin, Anna R.; Saks, Michael; Wright, Andrew
53
2006
Reach for \(A^\ast\): efficient point-to-point shortest path algorithms. Zbl 1428.68215
Goldberg, Andrew V.; Kaplan, Haim; Werneck, Renato F.
9
2006
Computing the shortest path: \(A^\ast\) search meets graph theory. Zbl 1297.05230
Goldberg, Andrew V.; Harrelson, Chris
50
2005
Collusion-resistant mechanisms for single-parameter agents. Zbl 1297.91079
Goldberg, Andrew V.; Hartline, Jason D.
21
2005
Derandomization of auctions. Zbl 1192.91095
Aggarwal, Gagan; Fiat, Amos; Goldberg, Andrew V.; Hartline, Jason D.; Immorlica, Nicole; Sudan, Madhu
14
2005
Maximum skew-symmetric flows and matchings. Zbl 1070.90090
Goldberg, Andrew V.; Karzanov, Alexander V.
27
2004
A lower bound on the competitive ratio of truthful auctions. Zbl 1122.91322
Goldberg, Andrew V.; Hartline, Jason D.; Karlin, Anna R.; Saks, Michael
3
2004
On memory-bound functions for fighting spam. Zbl 1122.94415
Dwork, Cynthia; Goldberg, Andrew; Naor, Moni
20
2003
Competitiveness via consensus. Zbl 1094.68517
Goldberg, Andrew V.; Hartline, Jason D.
8
2003
Competitive generalized auctions. Zbl 1192.91103
Fiat, Amos; Goldberg, Andrew V.; Hartline, Jason D.; Karlin, Anna R.
18
2002
Truthful and competitive double auctions. Zbl 1046.91046
Deshmukh, Kaustubh; Goldberg, Andrew V.; Hartline, Jason D.; Karlin, Anna R.
6
2002
Competitive auctions and digital goods. Zbl 0988.91024
Goldberg, Andrew V.; Hartline, Jason D.; Wright, Andrew
36
2001
Cut tree algorithms: An experimental study. Zbl 0969.68178
Goldberg, Andrew V.; Tsioutsiouliklis, Kostas
9
2001
A simple shortest path algorithm with linear average time. Zbl 1007.05088
Goldberg, Andrew V.
7
2001
Shortest path algorithms: engineering aspects. Zbl 1077.68728
Goldberg, Andrew V.
6
2001
Competitive auctions for multiple digital goods. Zbl 1037.91036
Goldberg, Andrew V.; Hartline, Jason D.
2
2001
Negative-cycle detection algorithms. Zbl 0954.90057
Cherkassky, Boris V.; Goldberg, Andrew V.
25
1999
Buckets, heaps, lists, and monotone priority queues. Zbl 0926.68092
Cherkassky, Boris V.; Goldberg, Andrew V.; Silverstein, Craig
18
1999
Flows in undirected unit capacity networks. Zbl 0918.90067
Goldberg, Andrew V.; Rao, Satish
4
1999
Cut tree algorithms. Zbl 0938.68071
Goldberg, Andrew V.; Tsioutsiouliklis, Kostas
3
1999
Beyond the flow decomposition barrier. Zbl 1064.90567
Goldberg, Andrew V.; Rao, Satish
100
1998
An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow. Zbl 0911.90153
Goldberg, Andrew V.; Oldham, Jeffrey D.; Plotkin, Serge; Stein, Cliff
11
1998
Augment or push? {A} computational study of bipartite matching and unit capacity flow algorithms. Zbl 1073.68903
Cherkassky, Boris V.; Goldberg, Andrew V.; Martin, Paul; Setubal, João C.; Stolfi, Jorge
9
1998
Recent developments in maximum flow algorithms (invited lecture). Zbl 1502.90182
Goldberg, Andrew V.
3
1998
On implementing the push-relabel method for the maximum flow problem. Zbl 0898.68029
Cherkassky, B. V.; Goldberg, A. V.
69
1997
Experimental study of minimum cut algorithms. Zbl 1321.05254
Chekuri, Chandra S.; Goldberg, Andrew V.; Karger, David R.; Levine, Matthew S.; Stein, Cliff
14
1997
Scaling methods for finding a maximum free multiflow of minimum cost. Zbl 0871.90030
Goldberg, Andrew V.; Karzanov, Alexander V.
7
1997
Global price updates help. Zbl 0891.90162
Goldberg, Andrew V.; Kennedy, Robert
7
1997
Implementations of Dijkstra’s algorithm based on multi-level buckets. Zbl 0898.90128
Goldberg, Andrew V.; Silverstein, Craig
3
1997
Buckets, heaps, lists, and monotone priority queues. Zbl 1321.68217
Cherkassky, Boris V.; Goldberg, Andrew V.; Silverstein, Craig
1
1997
Shortest paths algorithms: Theory and experimental evaluation. Zbl 0853.90111
Cherkassky, Boris V.; Goldberg, Andrew V.; Radzik, Tomasz
83
1996
Path problems in skew-symmetric graphs. Zbl 0867.05037
Goldberg, Andrew V.; Karzanov, Alexander V.
11
1996
Negative-cycle detection algorithms. Zbl 1379.68254
Cherkassky, Boris V.; Goldberg, Andrew V.
5
1996
Scaling algorithms for the shortest paths problem. Zbl 0831.68046
Goldberg, Andrew V.
41
1995
An efficient cost scaling algorithm for the assignment problem. Zbl 0846.90118
Goldberg, Andrew V.; Kennedy, Robert
18
1995
On implementing push-relabel method for the maximum flow problem. Zbl 1498.90237
Cherkassky, Boris V.; Goldberg, Andrew V.
10
1995
Maximum skew-symmetric flows. Zbl 1512.90236
Goldberg, Andrew V.; Karzanov, Alexander V.
3
1995
Improved approximation algorithms for network design problems. Zbl 0873.68005
Goemans, M. X.; Goldberg, A. V.; Plotkin, S.; Shmoys, D. B.; Tardos, É.; Williamson, D. P.
86
1994
Tight bounds on the number of minimum-mean cycle cancellations and related results. Zbl 0795.68098
Radzik, Tomasz; Goldberg, Andrew V.
9
1994
Shortest paths algorithms: Theory and experimental evaluation. Zbl 0867.90114
Cherkassky, Boris V.; Goldberg, Andrew V.; Radzik, Tomasz
7
1994
Path problems in skew-symmetric graphs. Zbl 0867.90118
Goldberg, Andrew V.; Karzanov, Alexander V.
1
1994
Sublinear-time parallel algorithms for matching and related problems. Zbl 0769.68034
Goldberg, Andrew V.; Plotkin, Serge A.; Vaidya, Pravin M.
11
1993
Approximating matchings in parallel. Zbl 0784.68065
Fischer, Ted; Goldberg, Andrew V.; Haglin, David J.; Plotkin, Serge
11
1993
A heuristic improvement of the Bellman-Ford algorithm. Zbl 0771.68091
Goldberg, Andrew V.; Radzik, Tomasz
9
1993
Scaling algorithms for the shortest paths problem. Zbl 0801.68132
Goldberg, Andrew V.
9
1993
On implementing scaling push-relabel algorithms for the minimum-cost flow problem. Zbl 0787.90021
Goldberg, Andrew V.; Kharitonov, Michael
4
1993
An efficient implementation of a scaling minimum-cost flow algorithm. Zbl 0924.90061
Goldberg, Andrew V.
2
1993
Finding minimum-cost flows by double scaling. Zbl 0761.90036
Ahuja, Ravindra K.; Goldberg, Andrew V.; Orlin, James B.; Tarjan, Robert E.
31
1992
Using interior-point methods for fast parallel algorithms for bipartite matching and related problems. Zbl 0743.68074
Goldberg, Andrew V.; Plotkin, Serge A.; Shmoys, David B.; Tardos, Eva
6
1992
A natural randomization strategy for multicommodity flow and related algorithms. Zbl 0773.90026
Goldberg, Andrew V.
5
1992
Combinatorial algorithms for the generalized circulation problem. Zbl 0734.90029
Goldberg, Andrew V.; Plotkin, Serge A.; Tardos, Éva
21
1991
Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Zbl 0743.90107
Goldberg, Andrew V.; Grigoriadis, Michael D.; Tarjan, Robert E.
19
1991
Compression and ranking. Zbl 0738.68048
Goldberg, Andrew V.; Sipser, Michael
13
1991
Processor-efficient implementation of a maximum flow algorithm. Zbl 0754.90024
Goldberg, Andrew V.
5
1991
Tight bounds on the number of minimum-mean cycle cancellations and related results. Zbl 0800.68644
Radzik, Tomasz; Goldberg, Andrew V.
1
1991
Finding minimum-cost circulations by successive approximation. Zbl 0727.90024
Goldberg, Andrew V.; Tarjan, Robert E.
87
1990
Network flow algorithms. Zbl 0728.90035
Goldberg, Andrew V.; Tardos, Éva; Tarjan, Robert E.
31
1990
Finding minimum-cost circulations by cancelling negative cycles. Zbl 0697.68063
Goldberg, Andrew V.; Tarjan, Robert E.
75
1989
A parallel algorithm for finding a blocking flow in an acyclic network. Zbl 0688.68034
Goldberg, Andrew V.; Tarjan, Robert E.
1
1989
A new approach to the maximum-flow problem. Zbl 0661.90031
Goldberg, Andrew V.; Tarjan, Robert E.
311
1988
Parallel symmetry-breaking in sparse graphs. Zbl 0671.05038
Goldberg, Andrew V.; Plotkin, Serge A.; Shannon, Gregory E.
82
1988
Parallel \((\Delta +1)\)-coloring of constant-degree graphs. Zbl 0653.68068
Goldberg, Andrew V.; Plotkin, Serge A.
12
1987
all top 5

Cited by 2,261 Authors

22 Goldberg, Andrew V.
16 Ljubić, Ivana
16 Orlin, James B.
15 Subramani, Krishnan
13 Nutov, Zeev
11 Feldmann, Andreas Emil
11 Guerriero, Francesca
11 Hochbaum, Dorit S.
11 Leitner, Markus
11 McCormick, S. Thomas
11 Nagamochi, Hiroshi
10 Barahona, Francisco
10 Barenboim, Leonid
10 Elkin, Michael
10 Mahjoub, Ali Ridha
10 Wagner, Dorothea
9 Babenko, Maxim A.
9 Karzanov, Aleksandr V.
8 Delling, Daniel
8 Hartline, Jason D.
8 Ibaraki, Toshihide
8 Kortsarz, Guy
8 Kuhn, Fabian
8 Mehlhorn, Kurt
8 Rauch Henzinger, Monika
8 Tarjan, Robert Endre
8 Williamson, David P.
7 Afraimovich, L. G.
7 D’Emidio, Mattia
7 Festa, Paola
7 Frigioni, Daniele
7 Ghiyasvand, Mehdi
7 Goldfarb, Donald
7 Lu, Pinyan
7 Sedeño-Noda, Antonio
7 Sinnl, Markus
7 Xiao, Mingyu
6 Baïou, Mourad
6 Bertsimas, Dimitris John
6 Desrosiers, Jacques
6 Dhamala, Tanka Nath
6 Di Puglia Pugliese, Luigi
6 Gauthier, Jean-Bertrand
6 González Martín, Carlos
6 Grandoni, Fabrizio
6 Micali, Silvio
6 Pyakurel, Urmila
6 Roughgarden, Tim
6 Schulz, Christian
6 Sidford, Aaron
6 Stein, Clifford
6 Végh, László A.
6 Wattenhofer, Roger P.
5 Ahuja, Ravindra K.
5 Alwen, Joël
5 Blocki, Jeremiah
5 Blum, Johannes
5 Chen, Jing
5 Chen, Ning
5 Chen, Yong
5 Chen, Zhizhong
5 Cheriyan, Joseph
5 D’Angelo, Gianlorenzo
5 De Baets, Bernard
5 Dean, Brian C.
5 Dory, Michal
5 Feigenbaum, Joan
5 Fleischer, Lisa K.
5 Hajiaghayi, Mohammad Taghi
5 Hao, Jianxiu
5 Hirai, Hiroshi
5 Kaplan, Haim
5 Kavitha, Telikepalli
5 Khandekar, Rohit
5 Konrad, Christian
5 Kosowski, Adrian
5 Krumke, Sven Oliver
5 Lin, Guohui
5 Mutzel, Petra
5 Papadimitriou, Christos Harilaos
5 Pettie, Seth
5 Sankowski, Piotr
5 Shenker, Scott J.
5 Su, Hsin-Hao
5 Suomela, Jukka
5 Viennot, Laurent
5 Xu, Yao
5 Zaroliagis, Christos D.
5 Zhang, An
4 Álvarez-Miranda, Eduardo
4 Balliu, Alkida
4 Brandt, Sebastian F.
4 Censor-Hillel, Keren
4 Chang, Yi-Jun
4 Chekuri, Chandra S.
4 Dibbelt, Julian
4 Dobzinski, Shahar
4 Esperet, Louis
4 Felner, Ariel
4 Fiat, Amos
...and 2,161 more Authors
all top 5

Cited in 183 Serials

63 European Journal of Operational Research
62 Theoretical Computer Science
56 Algorithmica
55 Discrete Applied Mathematics
54 Mathematical Programming. Series A. Series B
47 Networks
42 Computers & Operations Research
32 Information Processing Letters
26 SIAM Journal on Computing
25 Journal of Computer and System Sciences
23 Operations Research Letters
23 Journal of Combinatorial Optimization
22 Annals of Operations Research
19 Games and Economic Behavior
19 ACM Journal of Experimental Algorithmics
18 Theory of Computing Systems
15 Distributed Computing
15 Discrete Optimization
12 Optimization Letters
11 Computational Optimization and Applications
9 Artificial Intelligence
9 Applied Mathematics and Computation
9 INFORMS Journal on Computing
9 Journal of Discrete Algorithms
8 Operations Research
8 Information and Computation
8 SIAM Journal on Discrete Mathematics
7 Journal of Economic Theory
6 Discrete Mathematics
6 Information Sciences
6 Journal of Mathematical Imaging and Vision
6 Mathematical Problems in Engineering
5 Journal of Combinatorial Theory. Series B
5 Journal of Optimization Theory and Applications
5 Computational Geometry
5 International Journal of Foundations of Computer Science
5 Journal of Global Optimization
5 Automation and Remote Control
5 SIAM Journal on Optimization
5 International Transactions in Operational Research
4 Mathematics of Operations Research
4 Combinatorica
4 Applied Mathematical Modelling
4 Pattern Recognition
4 Cybernetics and Systems Analysis
4 The Electronic Journal of Combinatorics
4 Constraints
4 Optimization Methods & Software
4 Journal of Graph Algorithms and Applications
4 International Journal of Operations Research (Taichung)
4 EURO Journal on Computational Optimization
3 Physica A
3 Computing
3 Optimization
3 Asia-Pacific Journal of Operational Research
3 Random Structures & Algorithms
3 International Journal of Computational Geometry & Applications
3 Linear Algebra and its Applications
3 Journal of Computer and Systems Sciences International
3 International Journal of Computer Vision
3 Annals of Mathematics and Artificial Intelligence
3 OR Spectrum
3 Networks and Spatial Economics
3 Ars Mathematica Contemporanea
2 Computers & Mathematics with Applications
2 Automatica
2 Fuzzy Sets and Systems
2 Journal of Computer Science and Technology
2 Discrete & Computational Geometry
2 Journal of Automated Reasoning
2 Applied Mathematics Letters
2 Japan Journal of Industrial and Applied Mathematics
2 Discrete Event Dynamic Systems
2 SIAM Journal on Scientific Computing
2 Economic Theory
2 Journal of Heuristics
2 Parallel Algorithms and Applications
2 Journal of Scheduling
2 Journal of the ACM
2 Data Mining and Knowledge Discovery
2 CEJOR. Central European Journal of Operations Research
2 RAIRO. Operations Research
2 Differentsial’nye Uravneniya i Protsessy Upravleniya
2 JMMA. Journal of Mathematical Modelling and Algorithms
2 Journal of Applied Mathematics and Computing
2 4OR
2 Journal of Industrial and Management Optimization
2 The European Physical Journal B. Condensed Matter and Complex Systems
2 Algorithms
2 Mathematical Programming Computation
2 ACM Transactions on Algorithms
2 Theory of Computing
1 ACM Computing Surveys
1 Acta Informatica
1 Archive for Rational Mechanics and Analysis
1 International Journal of Mathematical Education in Science and Technology
1 International Journal of Systems Science
1 Journal of Computational Physics
1 Moscow University Mathematics Bulletin
1 Physics Reports
...and 83 more Serials
all top 5

Cited in 37 Fields

686 Operations research, mathematical programming (90-XX)
680 Computer science (68-XX)
397 Combinatorics (05-XX)
146 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
44 Information and communication theory, circuits (94-XX)
38 Numerical analysis (65-XX)
20 Statistics (62-XX)
12 Mathematical logic and foundations (03-XX)
12 Calculus of variations and optimal control; optimization (49-XX)
11 Convex and discrete geometry (52-XX)
11 Systems theory; control (93-XX)
8 Statistical mechanics, structure of matter (82-XX)
7 Probability theory and stochastic processes (60-XX)
7 Biology and other natural sciences (92-XX)
4 Dynamical systems and ergodic theory (37-XX)
3 Algebraic geometry (14-XX)
3 Linear and multilinear algebra; matrix theory (15-XX)
2 General algebraic systems (08-XX)
2 Number theory (11-XX)
2 Approximations and expansions (41-XX)
2 Manifolds and cell complexes (57-XX)
2 Mechanics of deformable solids (74-XX)
2 Quantum theory (81-XX)
1 General and overarching topics; collections (00-XX)
1 History and biography (01-XX)
1 Order, lattices, ordered algebraic structures (06-XX)
1 Commutative algebra (13-XX)
1 Associative rings and algebras (16-XX)
1 Group theory and generalizations (20-XX)
1 Several complex variables and analytic spaces (32-XX)
1 Partial differential equations (35-XX)
1 General topology (54-XX)
1 Algebraic topology (55-XX)
1 Mechanics of particles and systems (70-XX)
1 Fluid mechanics (76-XX)
1 Geophysics (86-XX)
1 Mathematics education (97-XX)

Citations by Year