On Dynamic Shortest Paths Problems

Algorithms – ESA 2004 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30140-0_52 ◽

2004 ◽

pp. 580-591 ◽

Author(s):

Liam Roditty ◽

Uri Zwick

Keyword(s):

Shortest Paths ◽

Dynamic Shortest Paths

Download Full-text

Improved Algorithms for Dynamic Shortest Paths

Algorithmica ◽

10.1007/s004530010043 ◽

2000 ◽

Vol 28 (4) ◽

pp. 367-389 ◽

Author(s):

H. N. Djidjev ◽

G. E. Pantziou ◽

C. D. Zaroliagis

Keyword(s):

Shortest Paths ◽

Dynamic Shortest Paths

Download Full-text

Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights

Algorithms — ESA’ 98 - Lecture Notes in Computer Science ◽

10.1007/3-540-68530-8_27 ◽

1998 ◽

pp. 320-331 ◽

Author(s):

D. Frigioni ◽

A. Marchetti-Spaccamela ◽

U. Nanni

Keyword(s):

Shortest Paths ◽

Negative Cycles ◽

Dynamic Shortest Paths

Download Full-text

Dynamic shortest paths minimizing travel times and costs

Networks ◽

10.1002/net.10072 ◽

2003 ◽

Vol 41 (4) ◽

pp. 197-205 ◽

Author(s):

Ravindra K. Ahuja ◽

James B. Orlin ◽

Stefano Pallottino ◽

Maria G. Scutellà

Keyword(s):

Shortest Paths ◽

Travel Times ◽

Dynamic Shortest Paths

Download Full-text

Semi-dynamic shortest paths and breadth-first search in digraphs

Lecture Notes in Computer Science - STACS 97 ◽

10.1007/bfb0023446 ◽

1997 ◽

pp. 33-46 ◽

Author(s):

Paolo Giulio Franciosa ◽

Daniele Frigioni ◽

Roberto Giaccio

Keyword(s):

Shortest Paths ◽

Breadth First Search ◽

Dynamic Shortest Paths

Download Full-text

Dynamic Shortest Paths Containers

Electronic Notes in Theoretical Computer Science ◽

10.1016/j.entcs.2003.12.023 ◽

2004 ◽

Vol 92 ◽

pp. 65-84 ◽

Author(s):

Dorothea Wagner ◽

Thomas Willhalm ◽

Christos Zaroliagis

Keyword(s):

Shortest Paths ◽

Dynamic Shortest Paths

Download Full-text

Fully dynamic shortest paths in digraphs with arbitrary arc weights

Journal of Algorithms ◽

10.1016/s0196-6774(03)00082-8 ◽

2003 ◽

Vol 49 (1) ◽

pp. 86-113 ◽

Author(s):

Daniele Frigioni ◽

Alberto Marchetti-Spaccamela ◽

Umberto Nanni

Keyword(s):

Shortest Paths ◽

Dynamic Shortest Paths

Download Full-text

On Dynamic Shortest Paths Problems

Algorithmica ◽

10.1007/s00453-010-9401-5 ◽

2010 ◽

Vol 61 (2) ◽

pp. 389-401 ◽

Author(s):

Liam Roditty ◽

Uri Zwick

Keyword(s):

Shortest Paths ◽

Dynamic Shortest Paths

Download Full-text

Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures

Journal of Discrete Algorithms ◽

10.1016/j.jda.2005.12.003 ◽

2006 ◽

Vol 4 (3) ◽

pp. 353-383 ◽

Author(s):

Camil Demetrescu ◽

Giuseppe F. Italiano

Keyword(s):

Data Structures ◽

Transitive Closure ◽

Shortest Paths ◽

Algorithmic Techniques ◽

Dynamic Shortest Paths

Download Full-text

Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs

Operations Research ◽

10.1287/opre.41.1.91 ◽

1993 ◽

Vol 41 (1) ◽

pp. 91-101 ◽

Author(s):

Harilaos N. Psaraftis ◽

John N. Tsitsiklis

Keyword(s):

Shortest Paths ◽

Dynamic Shortest Paths

Download Full-text

Dynamic Shortest Paths Minimizing Travel Times and Costs

SSRN Electronic Journal ◽

10.2139/ssrn.344442 ◽

2002 ◽

Author(s):

Ravindra K. Ahuja ◽

James B. Orlin ◽

Stefano Pallottino ◽

Maria G. Scutella

Keyword(s):

Shortest Paths ◽

Travel Times ◽

Dynamic Shortest Paths

Download Full-text