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

Item

ITEM ACTIONSEXPORT

Released

Journal Article

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

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44182

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

Locator

Link
(Any fulltext)

Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., Engels, C., Manthey, B., & Rao, R. B. V. (2015). Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. Algorithmica, 73(1), 42-62. doi:10.1007/s00453-014-9901-9.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0024-4211-B
Abstract
There is no abstract available