next up previous
Next: About this document ... Up: List of Publications Previous: Conferences

Selected Technical Reports

  1. Experimental Evaluation of a Parametric Flow Algorithm, by M. Babenko and A. V. Goldberg Technical Report MSR-TR-2006-77, Microsoft Research, 2006.
    Paper (pdf) / Copyright
  2. Routing in Networks with Low Doubling Dimension, by I. Abraham, C. Gavoille, A.  V. Goldberg, and D. Malkhi, Technical Report MSR-TR-2005-175, Microsoft Research, December 2005.
    Paper (pdf) / Copyright
  3. Reach for A*: Efficient Point-to-Point Shortest Path Algorithms, by A.  V. Goldberg, H. Kaplan, and R. Werneck, Technical Report MSR-TR-2005-132, Microsoft Research, October 2005.
    Paper (pdf) / Copyright
  4. Collusion-Resistant Mechanisms for Single-Parameter Agents by A.  V. Goldberg and J. D. Hartline, Technical Report MSR-TR-2004-40, Microsoft Research, May 2004.
    Paper (postscript) / Copyright
  5. Computing the Shortest Path: A* Search Meets Graph Theory by A.  V. Goldberg and C. Harrelson, Technical Report MSR-TR-2004-24, Microsoft Research, March 2004.
    Paper (postscript) / Copyright
  6. Competitiveness via Consensus by A.  V. Goldberg and J. D. Hartline, Technical Report MSR-TR-2002-73, Microsoft Research, June 2002.
    Paper (postscript) / Copyright
  7. A Simple Shortest Path Algorithm with Linear Average Time by A.  V. Goldberg, Technical Report STAR-TR-01-03, InterTrust Technologies Corp., March 2001.
    Paper (postscript) / Copyright
  8. Competitive Auctions for Multiple Digital Goods by A.  V. Goldberg and J. D. Hartline, Technical Report STAR-TR-00-01, InterTrust Technologies Corp., May 2000.
    Paper (postscript) / Copyright
  9. Competitive Auctions and Digital Goods by A.  V. Goldberg, J. D. Hartline and A. Wright, Technical Report STAR-TR-99-01, InterTrust Technologies Corp., September 1999.
    Paper (postscript) / Copyright
  10. Maximum Skew-Symmetric Flows and Their Applications to B-Matchings by A.  V. Goldberg and A. V. Karzanov, Technical Report 99-039, NEC Research Institute, Inc., April 1999.
    Paper (postscript) / Copyright
  11. A Prototype Implementation of Archival Intermemory by Y. Chen, J. Edler, A. V. Goldberg, A. Gottlieb, S. Sobti, and P. N. Yianilos, Technical Report 98-164, NEC Research Institute, Inc., December 1998.
    Paper (postscript) / Copyright
  12. Selecting Problems for Algorithm Evaluation by A.  V. Goldberg, Technical Report 98-142, NEC Research Institute, Inc., October 1998.
    Paper (postscript) / Copyright
  13. Cut Tree Algorithms, by A.  V. Goldberg and K. Tsioutsiouliklis, Technical Report 98-141, NEC Research Institute, Inc., October 1998.
    Paper (postscript) / Copyright
  14. Combinatorial Algorithms Test Sets (CATS): The ACM/EATCS Platform for Experimental Research, by A.  V. Goldberg and B. M. E. Moret, Technical Report 98-130, NEC Research Institute, Inc., September 1998.
    Paper (postscript) / Copyright
  15. Recent Developments in Maximum Flow Algorithms by Andrew V. Goldberg Technical Report 98-045, NEC Research Institute, Inc., April 1998.
    Paper (postscript) / Copyright
  16. An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow by Andrew V. Goldberg, Jeffrey D. Oldham, Serge Plotkin, and Cliff Stein, Technical Report 98-038, NEC Research Institute, Inc., April 1998.
    Paper (postscript) / Copyright
  17. 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, Technical Report 98-036R, NEC Research Institute, Inc., March 1998.
    Paper (postscript) / Copyright
    Related software.
  18. Towards an Archival Intermemory by A. V. Goldberg and P. N. Yianilos, Technical Report 97-149, NEC Research Institute, Inc., October 1997.
    Paper (postscript) / Copyright
  19. 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, Technical Report 97-127, NEC Research Institute, Inc., August 1997.
    Paper (postscript) / Copyright
  20. Computational Evaluation of Hot Queues by A. V. Goldberg and C. Silverstein, Technical Report 97-104, NEC Research Institute, Inc., June 1997.
    Paper (postscript) / Copyright
  21. Flows in Undirected Unit Capacity Networks by A. V. Goldberg and S. Rao, Technical Report 97-103, NEC Research Institute, Inc., June 1997.
    Paper (postscript) / Copyright
  22. Length Functions for Flow Computations by A. V. Goldberg and S. Rao, Technical Report 97-055, NEC Research Institute, Inc., March 1997.
    PAPER (AUGUST 1997 REVISION) (postscript) / Copyright
  23. Experimental Study of Minimum Cut Algorithms by C. S. Chekuri, A. V. Goldberg, D. R. Karger, M. S. Levine, and C. Stein, Technical Report 96-132, NEC Research Institute, Inc., October 1996.
    Paper (postscript) / Copyright
  24. Buckets, Heaps, Lists, and Monotone Priority Queues by B. V. Cherkassky, A. V. Goldberg, and C. Silverstein, Technical Report 96-070, NEC Research Institute, Inc., June 1996.
    Paper (postscript) / Copyright
    Related software.
  25. Expected Performance of Dijkstra's Shortest Path Algorithm by A. V. Goldberg and R. E. Tarjan, Technical Report 96-062, NEC Research Institute, Inc., June 1996.
    Paper (postscript) / Copyright
  26. Heap-on-Top Priority Queues by B. V. Cherkassky and A. V. Goldberg, Technical Report 96-042, NEC Research Institute, Inc., March 1996.
    Paper (postscript) / Copyright
  27. Negative-Cycle Detection Algorithms by B. V. Cherkassky and A. V. Goldberg, Technical Report 96-029, NEC Research Institute, Inc., March 1996.
    Paper (postscript) / Copyright
  28. Implementations of Dijkstra's Algorithm Based on Multi-Level Buckets by A. V. Goldberg and C. Silverstein, Technical Report 95-187, NEC Research Institute, Inc., November 1995.
    Paper (postscript) / Copyright
    Related software.
  29. Maximum Skew-Symmetric Flows by A. V. Goldberg and A. V. Karzanov, Technical Report 95-144, NEC Research Institute, Inc., September 1995.

  30. On Implementing Push-Relabel Method for the Maximum Flow Problem by B. V. Cherkassky and A. V. Goldberg, Technical Report STAN-CS-TR-94-1523, Department of Computer Science, Stanford University, Stanford, CA, September 1994.

  31. Global Price Updates Help by A. V. Goldberg and R. Kennedy, Technical Report STAN-CS-TR-94-1509, Department of Computer Science, Stanford University, Stanford, CA, March 1994.

  32. Path Problems in Skew-Symmetric Graphs by A. V. Goldberg and A. V. Karzanov, Technical Report STAN-CS-93-1489, Department of Computer Science, Stanford University, Stanford, CA, October 1993.

  33. An Efficient Cost Scaling Algorithm for the Assignment Problem by A. V. Goldberg and R. Kennedy, Technical Report STAN-CS-93-1481, Department of Computer Science, Stanford University, Stanford, CA, July 1993.

  34. Shortest Paths Algorithms: Theory and Experimental Evaluation by B. V. Cherkassky, A. V. Goldberg, and T. Radzik, Technical Report STAN-CS-93-1480, Department of Computer Science, Stanford University, Stanford, CA, July 1993.

  35. Transitive Fork Environments and Minimum Cost Multiflows by A. V. Goldberg and A. V. Karzanov, Technical Report STAN-CS-93-1476, Department of Computer Science, Stanford University, Stanford, CA, June 1993.

  36. Combinatorial Optimization: Lecture Notes for CS363/OR349 by A. V. Goldberg, Technical Report STAN-CS-93-1468, Department of Computer Science, Stanford University, Stanford, CA, March 1993.

  37. A Heuristic Improvement of the Bellman-Ford Algorithm by A. V. Goldberg and T. Radzik, Technical Report STAN-CS-93-1464, Department of Computer Science, Stanford University, Stanford, CA, March 1993.

  38. Lecture Notes: Topics in Combinatorial Optimization by A. V. Goldberg and S. A. Plotkin, Technical Report STAN-CS-92-1447, Department of Computer Science, Stanford University, Stanford, CA, October 1992.

  39. An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm by A. V. Goldberg, Technical Report STAN-CS-92-1439, Department of Computer Science, Stanford University, Stanford, CA, August 1992.
    Related software.
  40. Scaling Algorithms for the Shortest Paths Problem by A. V. Goldberg, Technical Report STAN-CS-92-1429, Department of Computer Science, Stanford University, Stanford, CA, May 1992.

  41. A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faults by A. V. Goldberg, B. M. Maggs, and S. A. Plotkin, Technical Report STAN-CS-92-1427, Department of Computer Science, Stanford University, Stanford, CA, April 1992.

  42. On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem by A. V. Goldberg and M. Kharitonov, Technical Report STAN-CS-92-1418, Department of Computer Science, Stanford University, Stanford, CA, March 1992.

  43. Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine by F. Alizadeh and A. V. Goldberg, Technical Report STAN-CS-92-1410, Department of Computer Science, Stanford University, Stanford, CA, February 1992.

  44. A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms by A. V. Goldberg, Technical Report STAN-CS-91-1372, Department of Computer Science, Stanford University, Stanford, CA, July 1991.

  45. Approximating Matchings in Parallel by T. Fischer, A. V. Goldberg, and S. Plotkin, Technical Report STAN-CS-91-1369, Department of Computer Science, Stanford University, Stanford, CA, June 1991.

  46. Combinatorial Optimization Lecture Notes for CS363/OR349, Winter 1991 by A. V. Goldberg, Technical Report STAN-CS-91-1358, Department of Computer Science, Stanford University, Stanford, CA, March 1991.

  47. Tight Bounds on the Number of Minimum-Mean Cycle Cancellations by T. Radzik and A. V. Goldberg, Technical Report STAN-CS-90-1328, Department of Computer Science, Stanford University, Stanford, CA, September 1990.

  48. Book Review: Flow Algorithms by G. M. Adel'son-Vel'ski, E. A. Dinic, and A. V. Karzanov by A. V. Goldberg and D. Gusfield, Technical Report STAN-CS-90-1313, Department of Computer Science, Stanford University, Stanford, CA, June 1990.

  49. Processor-Efficient Implementation of a Maximum Flow Algorithm by A. V. Goldberg, Technical Report STAN-CS-90-1301, Department of Computer Science, Stanford University, Stanford, CA, January 1990.

  50. Interior-Point Methods in Parallel Computation by A. V. Goldberg, S. A. Plotkin, D. Shmoys, and É. Tardos, Technical Report STAN-CS-89-1259, Department of Computer Science, Stanford University, Stanford, CA, May 1989.

  51. Network Flow Algorithms by A. V. Goldberg, É. Tardos, and R. E. Tarjan, Technical Report STAN-CS-89-1252, Department of Computer Science, Stanford University, Stanford, CA, March 1989.

  52. Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem by A. V. Goldberg, M. D. Grigoriadis, and R. E. Tarjan, Technical Report STAN-CS-89-1248, Department of Computer Science, Stanford University, Stanford, CA, February 1989.

  53. A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network by A. V. Goldberg and R. E. Tarjan, Technical Report STAN-CS-88-1228, Department of Computer Science, Stanford University, Stanford, CA, October 1988.

  54. Finding Minimum-Cost Flows by Double-Scaling by R. K. Ahuja, A. V. Goldberg, J. B. Orlin, and R. E. Tarjan, Technical Report STAN-CS-88-1227, Department of Computer Science, Stanford University, Stanford, CA, September 1988.

  55. Sublinear-Time Parallel Algorithms for Matching and Related Problems by A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya, Technical Report STAN-CS-88-1211, Department of Computer Science, Stanford University, Stanford, CA, June 1988.

  56. Combinatorial Algorithms for the Generalized Circulation Problem by A. V. Goldberg, S. A. Plotkin, and É. Tardos, Technical Report STAN-CS-88-1209, Department of Computer Science, Stanford University, Stanford, CA, June 1988.

  57. Finding Minimum-Cost Circulations by Successive Approximation by A. V. Goldberg and R. E. Tarjan, Technical Memo MIT/LCS/TM-333, Massachusetts Institute of Technology, Cambridge, MA, July 1987.

  58. Finding Minimum-Cost Circulations by Canceling Negative Cycles by A. V. Goldberg and R. E. Tarjan, Technical Memo MIT/LCS/TM-334, Massachusetts Institute of Technology, Cambridge, MA, July 1987.

  59. Efficient Graph Algorithms for Sequential and Parallel Computers by A. V. Goldberg, Technical Report MIT/LCS/TR-374, Massachusetts Institute of Technology, Cambridge, MA, February 1987.

  60. Efficient Parallel Algorithms for $ (D + 1)$ -Coloring and Maximal Independent Set Problems by A. V. Goldberg and S. Plotkin, Technical Memo MIT/LCS/TM-320, Massachusetts Institute of Technology, Cambridge, MA, January 1987.

  61. A New Max-Flow Algorithm by A. V. Goldberg, Technical Memo MIT/LCS/TM-291, Massachusetts Institute of Technology, Cambridge, MA, November 1985.

  62. GEM Tutorial 1: Getting Started by A. V. Goldberg and K. J. Lieberherr, Technical Note TN 84-163.5, GTE Laboratories Inc., Waltham, MA, December 1984.

  63. GEM User Manual by A. V. Goldberg and K. J. Lieberherr, Technical Note TN 84-163.4, GTE Laboratories Inc., Waltham, MA, December 1984.

  64. GEM: A Generator of Environments for Metaprogramming by A. V. Goldberg and K. J. Lieberherr, Technical Note TN 84-163.3, GTE Laboratories Inc., Waltham, MA, December 1984.

  65. Finding a Maximum Density Subgraph by A. V. Goldberg, Technical Report UCB/CSD 84/171, University of California, Berkeley, CA, May 1984.

next up previous
Next: About this document ... Up: List of Publications Previous: Conferences
Andrew 2007-10-20