✦ LIBER ✦

On the Complexity of Time-Dependent Shortest Paths

✍ Scribed by Luca Foschini, John Hershberger, Subhash Suri

Book ID: 120910038
Publisher: Springer
Year: 2012
Tongue: English
Weight: 736 KB
Volume: 68
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-012-9714-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The time-dependent shortest pair of disj

The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms

✍ Sherali, Hanif D.; Ozbay, Kaan; Subramanian, Shivaram 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 3 views

In this paper, we examine complexity issues, models, and algorithms for the problem of finding a shortest pair of disjoint paths between two nodes of a network such that the total travel delay is minimized, given that the individual arc delays are time-dependent. Such disjoint paths address the issu

The complexity of rerouting shortest pat

The complexity of rerouting shortest paths

✍ Bonsma, Paul 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 363 KB

Shortest Paths in Time-Dependent FIFO Ne

Shortest Paths in Time-Dependent FIFO Networks

✍ Frank Dehne; Masoud T. Omran; Jörg-Rüdiger Sack 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 776 KB

Reversibility of the time-dependent shor

Reversibility of the time-dependent shortest path problem

✍ Carlos F. Daganzo 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 53 KB

Shortest paths in piecewise continuous t

Shortest paths in piecewise continuous time-dependent networks

✍ M. Dell’Amico; M. Iori; D. Pretolani 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 894 KB

The approach-dependent, time-dependent,

The approach-dependent, time-dependent, label-constrained shortest path problem

✍ Hanif D. Sherali; Chawalit Jeenanunta; Antoine G. Hobeika 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB