✦ LIBER ✦

Querying Approximate Shortest Paths in Anisotropic Regions

✍ Scribed by Cheng, Siu-Wing; Na, Hyeon-Suk; Vigneron, Antoine; Wang, Yajun

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate Shortest Paths in Anisotropi

✍ Cheng, Siu-Wing; Na, Hyeon-Suk; Vigneron, Antoine; Wang, Yajun 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 310 KB

Algorithms for Approximate Shortest Path

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

Approximate shortest paths in weighted g

✍ Raphael Yuster 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Querying two boundary points for shortes

✍ Sang Won Bae; Yoshio Okamoto 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 296 KB

Query-point visibility constrained short

✍ Ramtin Khosravi; Mohammad Ghodsi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 661 KB

Shortest Path Queries Among Weighted Obs

✍ Chen, Danny Z.; Klenk, Kevin S.; Tu, Hung-Yi T. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 447 KB