next up previous
Next: Papers Submitted to Journals Up: List of Publications Previous: Books, Portions of Books,

Journals and Equivalent

  1. A Practical Shortest Path Algorithm with Linear Expected Time by A. V. Goldberg, to appear in SIAM Journal on Computing.
    Paper (postscript)
  2. Maximum Skew-Symmetric Flows and Matchings by A.  V. Goldberg and A. V. Karzanov, Math. Programming, Vol. 100, pages 537-568, 2004.
    Paper postscript, pdf / Copyright
  3. Computational Evaluation of Hot Queues by A. V. Goldberg and C. Silverstein, The Fifth DIMACS Implemtation Challenge (refereed proceedings), AMS, 2003.

  4. Cut Tree Algorithms: An Experimental Study, by A.  V. Goldberg and K. Tsioutsiouliklis, J. Algorithms, Vol. 38, pages 51-83, 2001.

  5. Negative-Cycle Detection Algorithms by B. V. Cherkassky and A. V. Goldberg, Mathematical Programming, Vol. 85, pages 277-311, 1999.
    Related software.
  6. Buckets, Heaps, Lists, and Monotone Priority Queues by B. V. Cherkassky, A. V. Goldberg, and C. Silverstein, SIAM Journal on Computing, Vol. 28, pages 1326-1346, 1999.
    Paper link.
  7. Flows in Undirected Unit Capacity Networks by A. V. Goldberg and S. Rao, SIAM Journal of Discrete Mathematics, Vol. 12, pages 1-5, 1999.
    Paper link.
  8. Augment or Push? A Computational Study of Bipartite Matching and Unit Capacity Flow Algorithms by B. V. Cherkassky, A. V. Goldberg, P. Martin, J. C. Setubal, and J. Stolfi, ACM Journal on Experimental Algorithmics, Vol. 3, 1999.
    Paper link.
  9. Beyond the Flow Decomposition Barrier by A. V. Goldberg and S. Rao, Journal of ACM, Vol. 45, pages 753-782, 1998.
    Paper link.
  10. Global Price Updates Help by A. V. Goldberg and R. Kennedy, SIAM Journal of Discrete Mathematics, Vol. 10, pages 551-572, 1997.
    Paper (postscript) / Copyright
  11. On Implementing Push-Relabel Method for the Maximum Flow Problem by B. V. Cherkassky and A. V. Goldberg, Algorithmica, Vol. 19, pages 390-410, 1997.
    Related software.
  12. Implementations of Dijkstra's Algorithm Based on Multi-Level Buckets by A. V. Goldberg and C. Silverstein, Network Optimization (refereed proceedings), Springer Lecture Notes in Economics and Mathematical Systems 450, edited by P. M. Pardalos, D. W. Hearn, and W. W. Hages, pages 292-327, 1997.
    Related software.
  13. Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost by A. V. Goldberg and A. V. Karzanov, Mathematics of Operations Research, Vol. 22, pages 90-109, February 1997.

  14. An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm by A. V. Goldberg, Journal of Algorithms, Vol. 22, pages 1-29, January 1997.
    Related software.
  15. Strategic Directions for Research in Theory of Computing by Anne Condon, Faith Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John Savage, Alan Selman, and David B. Shmoys, ACM Computing Surveys, Vol. 28, pages 575-590, December 1996.

  16. Path Problems in Skew-Symmetric Graphs by A. V. Goldberg and A. V. Karzanov, Combinatorica, Vol. 16, pages 353-382, September 1996.

  17. Shortest Paths Algorithms: Theory and Experimental Evaluation by B. V. Cherkassky, A. V. Goldberg, and T. Radzik, Mathematical Programming, Vol. 73, pages 129-174, June 1996.
    Related software.
  18. An Efficient Cost Scaling Algorithm for the Assignment Problem by A. V. Goldberg and R. Kennedy, Mathematical Programming, Vol. 71, pages 153-178, December 1995.

  19. Scaling Algorithms for the Shortest Paths Problem by A. V. Goldberg, SIAM Journal on Computing, Vol. 24, pages 494-504, May 1995.
    Paper (postscript) / Copyright
  20. A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches by A. V. Goldberg, B. M. Maggs, and S. A. Plotkin, IEEE Transactions on Computers, Vol. 43, pages 321-326, March 1994.

  21. Tight Bounds on the Minimum-Mean Cycle Cancellations and Related Results by T. Radzik and A. V. Goldberg, Algorithmica, Vol. 11, pages 226-242, March 1994.

  22. On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem by A. V. Goldberg and M. Kharitonov, The First DIMACS Implemtation Challenge (refereed proceedings), AMS, pages 157-198, September 1993.

  23. Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine by F. Alizadeh and A. V. Goldberg, The First DIMACS Implemtation Challenge (refereed proceedings), AMS, pages 65-96, September 1993.

  24. Approximating Matchings in Parallel by T. Fischer, A. V. Goldberg, D. J. Haglin, and S. Plotkin, Information Processing Letters, Vol. 46, pages 115-118, June 1993.

  25. A Heuristic Improvement of the Bellman-Ford Algorithm by A. V. Goldberg and T. Radzik, Applied Mathematics Letters, Vol. 6, No. 3, pages 3-6, May 1993.

  26. Sublinear-Time Parallel Algorithms for Matching and Related Problems by A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya, Journal of Algorithms, Vol. 14, pages 180-213, March 1993.

  27. A Natural Randomization Strategy for Multicommodity Flow and Related Problems by A. V. Goldberg, Information Processing Letters, Vol. 42, pages 249-256 July 1992.

  28. Finding Minimum-Cost Flows by Double-Scaling by R. K. Ahuja, A. V. Goldberg, J. B. Orlin, and R. E. Tarjan, Mathematical Programming, Series A, Vol. 53, pages 243-266, February 1992.

  29. Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems by A. V. Goldberg, S. A. Plotkin, D. Shmoys, and É. Tardos, SIAM Journal on Computing, Vol. 21, pages 140-150, February 1992.

  30. Processor-Efficient Implementation of a Maximum Flow Algorithm by A. V. Goldberg, Information Processing Letters, Vol. 38, pages 179-185, May 1991.

  31. Use of Dynamic Trees in a Network Simplex Algorithm for the Maximum Flow Problem by A. V. Goldberg, M. D. Grigoriadis, and R. E. Tarjan, Mathematical Programming, Series A, Vol. 50, No. 3, pages 277-290, June 1991.

  32. Book Review: Flow Algorithms by G. M. Adel'son-Vel'ski, E. A. Dinits, and A. V. Karzanov by A. V. Goldberg and D. Gusfield, SIAM Reviews, Vol. 33, No. 2, pages 306-314, June 1991.

  33. Compression and Ranking by A. V. Goldberg and M. Sipser, SIAM Journal on Computing, Vol. 20, No. 3, pages 524-536, June 1991.

  34. Combinatorial Algorithms for the Generalized Circulation Problem by A. V. Goldberg, S. A. Plotkin, and É. Tardos, Mathematics of Operations Research, Vol. 16, No. 2, pages 351-381, May 1991.

  35. Finding Minimum-Cost Circulations by Successive Approximation by A. V. Goldberg and R. E. Tarjan, Mathematics of Operations Research, Vol. 15, No. 3, pages 430-466, August 1990.

  36. Finding Minimum-Cost Circulations by Canceling Negative Cycles by A. V. Goldberg and R. E. Tarjan, Journal of ACM, Vol. 36, No. 4, pages 873-886, October 1989.

  37. A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network by A. V. Goldberg and R. E. Tarjan, Information Processing Letters, Vol. 31, No. 5, pages 265-272, June 1989.

  38. Parallel Symmetry-Breaking in Sparse Graphs by A. V. Goldberg, S. A. Plotkin, and G. E. Shannon, SIAM Journal of Discrete Mathematics, Vol. 1, No. 4, pages 434-446, November 1988.

  39. A New Approach to the Maximum Flow Problem by A. V. Goldberg and R. E. Tarjan, Journal of ACM, Vol. 35, No. 4, pages 921-940, October 1988.

  40. Parallel $ (D + 1)$ -Coloring of Constant-Degree Graphs by A. V. Goldberg and S. A. Plotkin, Information Processing Letters, Vol. 25, pages 241-245, June 1987.

  41. Approaches Toward Silicon Compilation by A. V. Goldberg, S. S. Hirschhorn, and K. J. Lieberherr, IEEE Circuits and Devices, pages 29-39, May 1985.

  42. Competitive Auctions by A.  V. Goldberg, J. D. Hartline, A. Karlin, M. Saks, and A. Wright, Games and Economic Behavior, 2006.
    Paper (postscript)

next up previous
Next: Papers Submitted to Journals Up: List of Publications Previous: Books, Portions of Books,
Andrew 2007-10-20