✦ LIBER ✦

Computing k-shortest path lengths in euclidean networks

✍ Scribed by Christopher C. Skiscim; Bruce L. Golden

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 496 KB
Volume: 17
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230170308

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Euclidean shortest path in the presence

Euclidean shortest path in the presence of obstacles

✍ Yong-Mao Chen; Prakash Ramanan 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 405 KB

Shortest-Path Routing in Arbitrary Netwo

Shortest-Path Routing in Arbitrary Networks

✍ Friedhelm Meyer auf der Heide; Berthold Vöcking 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 197 KB

We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in Ž . O C q D q log N steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for

Optimal routing in shortest-path data ne

Optimal routing in shortest-path data networks

✍ K. G. Ramakrishnan; Manoel A. Rodrigues 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 249 KB 👁 1 views

Finding the Kth shortest path in a time-

Finding the Kth shortest path in a time-schedule network

✍ Yen-Liang Chen; Kwei Tang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

A lower bound on the average shortest pa

A lower bound on the average shortest path length in regular graphs

✍ V. G. Cerf; D. D. Cowan; R. C. Mullin; R. G. Stanton 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

A note on Arc tolerances in sparse short

A note on Arc tolerances in sparse shortest-path and network flow problems

✍ Dan Gusfield 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 298 KB 👁 1 views