de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors

Arikati,  Srinivasa Rao
Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44283

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45509

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45787

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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: 4th Annual European Symposium (pp. 514-528). Berlin: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AB9B-F
Abstract
There is no abstract available