Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Shortest path problem

Known as: Singledestination shortest path problem, Shortest path routing, Single-destination shortest path problem 
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole… Expand
  • table 2
Highly Cited
2005
Highly Cited
2005
In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2005
Highly Cited
2005
We develop a shortest augmenting path algorithm for the linear assignment problem. It contains new initialization routines and a… Expand
  • table 1
  • figure 3
  • figure 4
  • figure 6
  • table 2
Highly Cited
2005
Highly Cited
2005
We propose shortest path algorithms that use A* search in combination with a new graph-theoretic lower-bounding technique based… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 7
Highly Cited
2002
Highly Cited
2002
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1998
Highly Cited
1998
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1994
Highly Cited
1994
  • D. Eppstein
  • Proceedings 35th Annual Symposium on Foundations…
  • 1994
  • Corpus ID: 31351733
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1994
Highly Cited
1994
We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 2
  • figure 6
Highly Cited
1992
Highly Cited
1992
This note contains two fully polynomial approximation schemes for the shortest path problem with an additional constraint. The… Expand
Highly Cited
1969
Highly Cited
1969
This paper treats five discrete shortest-path problems: 1 determining the shortest path between two specified nodes of a network… Expand