✦ LIBER ✦

A Practical Shortest Path Algorithm with Linear Expected Time

✍ Scribed by Goldberg, Andrew V.

Book ID: 118180894
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 220 KB
Volume: 37
Category: Article
ISSN: 0097-5397
DOI: 10.1137/070698774

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple linear expected time algorithm

A simple linear expected time algorithm for finding a hamilton path

✍ Andrew Thomason 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Discrete Mathematics 75 (1989) 373-379 North-Holland n?", so the problem is one of finding a fast algorithm which works on all graphs in %(n, p) except for a proportion somewhat smaller than 2~". This will be our algorithm A2. A very fast algorithm, which works on most graphs but not on as many as A

A theorem on the expected complexity of

A theorem on the expected complexity of dijkstra's shortest path algorithm

✍ Kohei Noshita 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 433 KB

A polynomial-time algorithm to find shor

A polynomial-time algorithm to find shortest paths with recourse

✍ J. Scott Provan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

A finite-time algorithm for shortest pat

A finite-time algorithm for shortest path problems with time-varying costs

✍ A.B. Philpott; A.I. Mees 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 338 KB

A routing algorithm with candidate short

A routing algorithm with candidate shortest path

✍ Qijing Pan 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 881 KB

A reoptimization algorithm for the short

A reoptimization algorithm for the shortest path problem with time windows

✍ Martin Desrochers; François Soumis 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 879 KB