English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., Engels, C., Manthey, B., & Rao, R. B. V. (2013). Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. In K. Chatterjee, & J. Sgall (Eds.), Mathematical Foundations of Computer Science 2013 (pp. 219-230). Berlin: Springer. doi:10.1007/978-3-642-40313-2_21.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0015-3B7F-D
Abstract
There is no abstract available