✦ LIBER ✦

Euclidean shortest path in the presence of obstacles

✍ Scribed by Yong-Mao Chen; Prakash Ramanan

Publisher: John Wiley and Sons
Year: 1991
Tongue: English
Weight: 405 KB
Volume: 21
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230210302

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing k-shortest path lengths in euc

Computing k-shortest path lengths in euclidean networks

✍ Christopher C. Skiscim; Bruce L. Golden 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 496 KB

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

The cardinality-constrained shortest pat

The cardinality-constrained shortest path problem in 2-graphs

✍ Geir Dahl; Bjørnar Realfsen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 2 views

On the complexity of finding paths in a

On the complexity of finding paths in a two-dimensional domain I: Shortest paths

✍ Arthur W. Chou; Ker-I Ko 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

## Abstract The computational complexity of finding a shortest path in a two‐dimensional domain is studied in the Turing machine‐based computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomial‐time computable two‐dimensional do

A note on the problem of updating shorte

A note on the problem of updating shortest paths

✍ Satoru Fujishige 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 161 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