English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-4211-B Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-6028-0
Genre: Journal Article
Latex : Random Shortest Paths: {Non-Euclidean} Instances for Metric Optimization Problems

Files

show Files

Locators

show
hide
Locator:
Link (Any fulltext)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Bringmann, Karl1, Author           
Engels, Christian2, Author
Manthey, Bodo2, Author
Rao, Raghavendra B. V.2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: Random shortest paths; First passage percolation; Approximation algorithms; Random metrics
 Abstract: -

Details

show
hide
Language(s): eng - English
 Dates: 20142015
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1007/s00453-014-9901-9
BibTex Citekey: bringmann_shortest_2014
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithmica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: New York, NY : Springer
Pages: - Volume / Issue: 73 (1) Sequence Number: - Start / End Page: 42 - 62 Identifier: ISSN: 0178-4617