Andrew V. Goldberg

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Tomasz Radzik

> Home > Persons > Andrew V. Goldberg

Publications

1996
[j21]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/CherkasskyGR96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/CherkasskyGR96
Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik:
Shortest paths algorithms: Theory and experimental evaluation. Math. Program. 73: 129-174 (1996)
1994
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/RadzikG94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/RadzikG94
Tomasz Radzik, Andrew V. Goldberg:
Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. Algorithmica 11(3): 226-242 (1994)
[c19]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/CherkasskyGR94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/CherkasskyGR94
Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik:
Shortest Paths Algorithms: Theory and Experimental Evaluation. SODA 1994: 516-525
1991
[c13]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/RadzikG91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/RadzikG91
Tomasz Radzik, Andrew V. Goldberg:
Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. SODA 1991: 110-119

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.