Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik  Home/Search
Context Related
| stanford.edu/pub/g...ncs931480.ps.gz stanford.edu/pub/goldberg...spalg.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu (more) From: stanford.edu (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of... (Update)
Cited by: More
Symmetric Cardinality Constraint with Costs - Waldemar Kocjan Per (Correct)
Circular Shortest Path in Images - Sun, Pallottino (2003) (Correct)
Dijkstra's Algorithm On-Line: An Empirical Case Study from .. - Schulz, Wagner, Weihe (2000) (Correct)
Active bibliography (related documents): More All
1.1: SPT_L shortest path algorithms: review, new proposals.. - Nonato, Pallottino.. (1999) (Correct)
0.8: Shortest Path Algorithms in Transportation Models.. - Pallottino, Scutellà (1998) (Correct)
0.7: A Heuristic Improvement Of The Bellman-Ford Algorithm - Goldberg, Radzik (1993) (Correct)
Similar documents based on text: More All
0.3: Implementing Parallel Shortest-Paths Algorithms - Papaefthymiou, Rodrigue (1994) (Correct)
0.3: Negative-Cycle Detection Algorithms - Cherkassky, Goldberg (1996) (Correct)
0.2: Experimental Study of a Solution Method for Multicommodity Flow.. - Radzik (2000) (Correct)
Related documents from co-citation: More All
33: Introduction to algorithms (context) - Cormen, Leiserson et al. - 1991
30: Fibonacci heaps and their uses in improved network optimization algorithms (context) - Fredman, Tarjan - 1987
22: A note on two problems in connexion with graphs (context) - Dijkstra - 1959
BibTeX entry: (Update)
Boris V. Cherkassky, Andrew V. Goldberg, and Tomasz Radzik. Shortest path algorithms: Theory and experimental evaluation. Draft, July 1993. http://citeseer.ist.psu.edu/cherkassky93shortest.html More
@inproceedings{ cherkassky94shortest,
author = "Boris V. Cherkassky and Andrew V. Goldberg and Tomasz Radzik",
title = "Shortest Paths Algorithms: Theory and Experimental Evaluation",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1994",
url = "citeseer.ist.psu.edu/cherkassky93shortest.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
353 Fibonacci Heaps and Their Uses in Improved Network Optimizat.. (context) - Fredman, Tarjan - 1987
310 A Note on Two Problems in Connection with Graphs (context) - Dijkstra - 1959
164 Society for Industrial and Applied Mathematics (context) - Tarjan, Network - 1983
148 Combinatorial Optimization: Networks and Matroids (context) - Lawler - 1976
83 Princeton Univ (context) - Ford, Fulkerson et al. - 1962
72 a Routing Problem (context) - Bellman - 1958
63 Faster Algorithms for the Shortest Path Problem (context) - Ahuja, Mehlhorn et al. - 1988
61 Faster Scaling Algorithms for Network Problems (context) - Gabow, Tarjan - 1989
56 The Shortest Path Through a Maze (context) - Moore - 1959
31 Algorithm 360: Shortest Path Forest with Topological Orderin.. (context) - Dial - 1969
26 Scaling Algorithms for the Shortest Paths Problem (context) - Goldberg - 1993
22 Implementation and Efficiency of Moore Algorithms for the Sh.. (context) - Pape - 1974
22 Shortest Paths Algorithms (context) - Gallo, Pallottino - 1988
11 Computational Study of an Improved Shortest Path Algorithm (context) - Glover, Glover et al. - 1984
11 The Auction Algorithm for Shortest Paths - Bertsekas - 1991
9 Interrelations and New Propositions (context) - Pallottino, Complexity - 1984
7 A Heuristic Improvement of the Bellman-Ford Algorithm - Goldberg, Radzik - 1993
6 A New Polynomially Bounded Shortest Paths Algorithm (context) - Glover, Klingman et al. - 1985
6 DIMACS Implementation Challenge Workshop: Algorithms for Net.. (context) - Johnson, McGeoch
5 A Note on Finding Shortest Paths Trees (context) - Kershenbaum - 1981
4 Neleneinye Setevye Transportnye Zadachi (context) - Ju, Livshits - 1972
2 Properties of Labeling Mehtods for Determinimg Shortest Path.. (context) - Shier, Witzgall - 1981
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/theory.stanford.edu.html): More
Partial Orderings of Event Sets and Their.. - Luckham, Vera.. (1992) (Correct)
Classes = Objects + Data Abstraction - Fisher (Correct)
An Efficient System For Geometric Assembly.. - Romney, Godard.. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC