✦ LIBER ✦

Approximating Shortest Paths on a Nonconvex Polyhedron

✍ Scribed by Varadarajan, Kasturi R.; Agarwal, Pankaj K.

Book ID: 118177580
Publisher: Society for Industrial and Applied Mathematics
Year: 2000
Tongue: English
Weight: 264 KB
Volume: 30
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539799352759

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating Shortest Paths on Weighted

Approximating Shortest Paths on Weighted Polyhedral Surfaces

✍ M. Lanthier; A. Maheshwari; J. -R. Sack 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 689 KB

Algorithms for Approximate Shortest Path

Algorithms for Approximate Shortest Path Queries on

✍ Lyudmil Aleksandrov; Hristo N. Djidjev; Hua Guo; Anil Maheshwari; Doron Nussbaum 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 919 KB

Approximate Shortest Paths Guided by a S

Approximate Shortest Paths Guided by a Small Index

✍ Jörg Derungs; Riko Jacob; Peter Widmayer 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 552 KB

A note on k-shortest paths problem

✍ Nick Gravin; Ning Chen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this article, we generalize this to shortest k edgedisjoint s-t path

On a multicriteria shortest path problem

✍ Ernesto Queirós Vieira Martins 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 617 KB

Approximate Shortest Paths and Geodesic

Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions

✍ S. Har-Peled 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 367 KB