Results 11  20
of
6,963
On degree constrained shortest paths
 European Symposium on Algorithms (ESA
, 2005
"... Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a variant of the shortest path problem. The network has two kinds of edges, “actual ” edges and “potential ” edges. In ad ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a variant of the shortest path problem. The network has two kinds of edges, “actual ” edges and “potential ” edges
Circular Shortest Path in Images
 Pattern Recognition
, 2003
"... Shortest path algorithms have been used in a number of applications such as crack detection, road or linear feature extraction in images. There are applications where the starting and ending positions of the shortest path need to be constrained. In this paper, we present several new algorithms for t ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
Shortest path algorithms have been used in a number of applications such as crack detection, road or linear feature extraction in images. There are applications where the starting and ending positions of the shortest path need to be constrained. In this paper, we present several new algorithms
Shortest Path Geometric Rounding
, 2000
"... Exact implementations of algorithms of computational geometry are subject to exponential growth in running time and space. In particular, coordinate bitcomplexity can grow exponentially when algorithms are cascaded: the output of one algorithm becomes the input to the next. Cascading is a signic ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
signicant problem in practice. We propose a geometric rounding technique: shortest path rounding. Shortest path rounding trades accuracy for space and time and eliminates the exponential cost introduced by cascading. It can be applied to all algorithms which operate on planar polygonal regions
On the Bottleneck Shortest Path Problem
, 2006
"... The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to determine the limiting capacity of any path between two specified vertices of the network. This is equivalent to determining the unsplittable maximum flow between the two vertices. In this note we analyze ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to determine the limiting capacity of any path between two specified vertices of the network. This is equivalent to determining the unsplittable maximum flow between the two vertices. In this note we
An Auction Algorithm for Shortest Paths
, 1991
"... We propose a new and simple algorithm for finding shortest paths in a directed graph. In the single origin/single destination case, the algorithm maintains a single path starting at the origin, which is extended or contracted by a single node at each iteration. Simultaneously, at most one dual varia ..."
Abstract

Cited by 30 (7 self)
 Add to MetaCart
We propose a new and simple algorithm for finding shortest paths in a directed graph. In the single origin/single destination case, the algorithm maintains a single path starting at the origin, which is extended or contracted by a single node at each iteration. Simultaneously, at most one dual
Engineering Shortest Path Algorithms
"... In this paper, we report on our own experience in studying a fundamental problem on graphs: all pairs shortest paths. In particular, we discuss the interplay between theory and practice in engineering a simple variant of Dijkstra's shortest path algorithm. In this context, we show that stud ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper, we report on our own experience in studying a fundamental problem on graphs: all pairs shortest paths. In particular, we discuss the interplay between theory and practice in engineering a simple variant of Dijkstra's shortest path algorithm. In this context, we show
Geometric Shortest Path Containers
, 2004
"... In this paper, we consider Dijkstra's algorithm for the single source single target shortest path problem in large sparse graphs. The goal is to reduce the response time for online queries by using precomputed information. Due to the size of the graph, preprocessing space requirements can b ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper, we consider Dijkstra's algorithm for the single source single target shortest path problem in large sparse graphs. The goal is to reduce the response time for online queries by using precomputed information. Due to the size of the graph, preprocessing space requirements can
The Generalized Shortest Path Problem
"... this paper we show that the generalized shortest path problem can be solved efficiently for multiplicative weights. The solution is running Dijkstra's algorithm in reverse. In the case of additive weights there is a dynamic programming approach and a pseudopolynomial algorithm. Finally, if the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this paper we show that the generalized shortest path problem can be solved efficiently for multiplicative weights. The solution is running Dijkstra's algorithm in reverse. In the case of additive weights there is a dynamic programming approach and a pseudopolynomial algorithm. Finally
Dynamic Shortest Paths Containers
, 2004
"... Using a set of geometric containers to speed up shortest path queries in a weighted graph has been proven a useful tool for dealing with large sparse graphs. Given a layout of a graph G =(V,E), we store, for each edge (u, v) ∈ E, the bounding box of all nodes t ∈ V for which a shortest utpath sta ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Using a set of geometric containers to speed up shortest path queries in a weighted graph has been proven a useful tool for dealing with large sparse graphs. Given a layout of a graph G =(V,E), we store, for each edge (u, v) ∈ E, the bounding box of all nodes t ∈ V for which a shortest utpath
On the robust shortest path problem
 Computers and Operations Research
, 1998
"... The shortest path (SP) problem in a network with nonnegative arc lengths can be solved easily by Dijkstra’s labeling algorithm in polynomial time. In the case of significant uncertainty of the arc lengths, a robustness approach is more appropriate. In this paper, we study the SP problem under arc le ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
The shortest path (SP) problem in a network with nonnegative arc lengths can be solved easily by Dijkstra’s labeling algorithm in polynomial time. In the case of significant uncertainty of the arc lengths, a robustness approach is more appropriate. In this paper, we study the SP problem under arc
Results 11  20
of
6,963