The following publications are possibly variants of this publication:
- Determining approximate shortest paths on weighted polyhedral surfacesLyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack. JACM, 52(1):25-53, 2005. [doi]
- Approximating Weighted Shortest Paths on Polyhedral SurfacesMark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack. compgeom 1997: 274-283 [doi]
- Approximating Weighted Shortest Paths on Polyhedral SurfacesMark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack. compgeom 1997: 485-486 [doi]
- Approximate Shortest Path Queries on Weighted Polyhedral SurfacesLyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack. mfcs 2006: 98-109 [doi]
- Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral SurfacesLyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack. dcg, 44(4):762-801, 2010. [doi]
- An epsilon-Approximation for Weighted Shortest Paths on Polyhedral SurfacesLyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack. swat 1998: 11-22 [doi]