Results 1  10
of
3,395
Incremental ShortestPath Problem
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract
 Add to MetaCart
The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also
On dynamic shortest paths problems
, 2004
"... We obtain the following results related to dynamic versions of the shortestpaths problem: (i) Reductions that show that the incremental and decremental singlesource shortestpaths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static allpairs ..."
Abstract

Cited by 41 (2 self)
 Add to MetaCart
We obtain the following results related to dynamic versions of the shortestpaths problem: (i) Reductions that show that the incremental and decremental singlesource shortestpaths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static all
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
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
Robust shortest path problems
"... This paper is a state of the art on the shortest path problems for which it exists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the socalled interval model and the discrete set of scenarios model. Different measures and approaches of robustness are ..."
Abstract
 Add to MetaCart
This paper is a state of the art on the shortest path problems for which it exists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the socalled interval model and the discrete set of scenarios model. Different measures and approaches of robustness
ON ASSOCIATIVE SHORTEST PATH PROBLEMS By
"... We consider a wide classof shortest path problems in acyclic di graphs. In the problems, the length of a path is defined by using an associative binary operation. We derive recursive equations in dynamic programming for the problems, which involve additive, multiplicative, multiplicativeadditive, m ..."
Abstract
 Add to MetaCart
We consider a wide classof shortest path problems in acyclic di graphs. In the problems, the length of a path is defined by using an associative binary operation. We derive recursive equations in dynamic programming for the problems, which involve additive, multiplicative, multiplicative
On the History of the Shortest Path Problem
 DOCUMENTA MATH.
, 2012
"... It is difficult to trace back the history of the shortest path problem. One can imagine that even in very primitive (even animal) societies, finding short paths (for instance, to food) is essential. Compared with other combinatorial optimization problems, like shortest spanning tree, assignment and ..."
Abstract
 Add to MetaCart
It is difficult to trace back the history of the shortest path problem. One can imagine that even in very primitive (even animal) societies, finding short paths (for instance, to food) is essential. Compared with other combinatorial optimization problems, like shortest spanning tree, assignment
On the Inverse Shortest Paths Problem
"... In this paper we survey a variant of the inverse shortest paths problem. Given is a network in which certain nodepairs require connections over specific predefined single paths. The aim is to find link weights such that the desired paths are uniquely induced by a shortestpath algorithm. Further we ..."
Abstract
 Add to MetaCart
In this paper we survey a variant of the inverse shortest paths problem. Given is a network in which certain nodepairs require connections over specific predefined single paths. The aim is to find link weights such that the desired paths are uniquely induced by a shortestpath algorithm. Further
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
Random assignment and shortest path problems
, 2006
"... We explore a similarity between the n by n random assignment problem and the random shortest path problem on the complete graph on n + 1 vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003. We g ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We explore a similarity between the n by n random assignment problem and the random shortest path problem on the complete graph on n + 1 vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003. We
Results 1  10
of
3,395