Andrew V. Goldberg, Tomasz Radzik  Home/Search
Context Related
| stanford.edu/pub/goldberg/gor.ps.Z stanford.edu/pub/g...ancs931464.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 describe a new shortest paths algorithm. Our algorithm achieves the same O(nm) worst-case time bound as Bellman-Ford algorithm but is superior in practice. 1. Introduction The Bellman-Ford algorithm [1, 4, 7] is a classical algorithm for the single-source shortest paths problem. The algorithm runs in O(nm) time on a graph with n nodes and m arcs. This is the best currently known strongly polynomial bound for the problem (see [6] for the best weakly polynomial bound). In practice,... (Update)
Context of citations to this paper: More
...generated graphs. Finally, let us mention another list search algorithm, i.e. the recent topological ordering algorithm of Goldberg and Radzik [1993]. This algorithm tries to propagate as much as possible the label updating due to the nodes in Q by means of a topological visit...
.... which inspired two of the most robust algorithms for the shortest path tree problem, due to Tarjan [27] and to Goldberg and Radzik [18], allows the proposal of some variants. A computational study of such variants is conducted on the same test problem families used in [6] in...
Cited by: More
Unknown - Ya--- Fi Mu (2003) (Correct)
On computing the Pareto optimal solution set in a large scale.. - Daruwala (2002) (Correct)
Maintaining Shortest Paths in Digraphs with.. - Demetrescu.. (2000) (Correct)
Similar documents (at the sentence level):
25.0%: Shortest Paths Algorithms: Theory And Experimental.. - Cherkassky, Goldberg.. (1993) (Correct)
10.5%: Negative-Cycle Detection Algorithms - Cherkassky, Goldberg (1996) (Correct)
Active bibliography (related documents): More All
0.2: SPT_L shortest path algorithms: review, new proposals.. - Nonato, Pallottino.. (1999) (Correct)
0.1: Parallel Shortest Path Algorithms: Identifying the Factors that.. - Hribar (1998) (Correct)
0.1: Directed Single-Source Shortest-Paths in Linear Average-Case Time - Meyer (2001) (Correct)
Similar documents based on text: More All
0.1: Computing Undirected Shortest Paths with Comparisons and.. - Pettie, Ramachandran (2001) (Correct)
0.1: A Cluster-based Approach for Routing in Dynamic Networks - Krishna, Vaidya.. (1997) (Correct)
0.1: Instance-Specific Accelerators for Minimum Covering - Plessl, Platzner (2001) (Correct)
Related documents from co-citation: More All
5: Implementation and Efficiency of Moore Algorithms for the Shortest Root Problem (context) - Pape - 1974
5: Computational study of an improved shortest path algorithm (context) - Glover, Glover et al. - 1984
5: Shortest path algorithms: Theory and experimental evaluation - Cherkassky, Goldberg et al. - 1993
BibTeX entry: (Update)
A. V. Goldberg and T. Radzik. A Heuristic Improvement of the Bellman-Ford Algorithm. Applied Math. Let., 6:3--6, 1993. http://citeseer.ist.psu.edu/goldberg93heuristic.html More
@article{ goldberg93heuristic,
author = "Goldberg and Radzik",
title = "A Heuristic Improvement of the Bellman-Ford Algorithm",
journal = "AMLETS: Applied Mathematics Letters",
volume = "6",
year = "1993",
url = "citeseer.ist.psu.edu/goldberg93heuristic.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
83 Princeton Univ (context) - Ford, Fulkerson et al. - 1962
72 a Routing Problem (context) - Bellman - 1958
56 The Shortest Path Through a Maze (context) - Moore - 1959
26 Scaling Algorithms for the Shortest Paths Problem (context) - Goldberg - 1993
22 Implementation and Efficiency of Moore Algorithms for the Sh.. (context) - Pape - 1974
9 Interrelations and New Propositions (context) - Pallottino, Complexity - 1984
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