Planar Spanners and Approximate Shortest Path Queries among Obstacles in the 
Plane

Arikati, Srinivasa Rao; Chen, Danny Z.; Chew, L. Paul; Das, Gautam; Smid, Michiel; Zaroliagis, Christos

doi:10.1007/3-540-61680-2_79

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane

MPS-Authors

Arikati, Srinivasa Rao
Max Planck Society;

/persons/resource/persons44283

Das, Gautam
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45509

Smid, Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45787

Zaroliagis, Christos
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dt9wJ
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Arikati, S. R., Chen, D. Z., Chew, L. P., Das, G., Smid, M., & Zaroliagis, C. (1996). Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. In J. Diaz, & M. Serna (Eds.), Algorithms - ESA '96 (pp. 514-528). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AB9B-F

Abstract

There is no abstract available