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

Lyudmil Aleksandrov et al. (2013)

> Home

Details and statistics

DOI: 10.1007/S00454-013-9486-0

access: open

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dcg/AleksandrovDMS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/AleksandrovDMS13
Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack:
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discret. Comput. Geom. 50(1): 124-184 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.