An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains

Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack. An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discrete & Computational Geometry, 50(1):124-184, 2013. [doi]

@article{AleksandrovDMS13,
  title = {An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains},
  author = {Lyudmil Aleksandrov and Hristo Djidjev and Anil Maheshwari and Jörg-Rüdiger Sack},
  year = {2013},
  doi = {10.1007/s00454-013-9486-0},
  url = {http://dx.doi.org/10.1007/s00454-013-9486-0},
  researchr = {https://researchr.org/publication/AleksandrovDMS13},
  cites = {0},
  citedby = {0},
  journal = {Discrete & Computational Geometry},
  volume = {50},
  number = {1},
  pages = {124-184},
}