Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931)
From MaRDI portal
(Redirected from Item:Q2849911)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Random shortest paths: non-Euclidean instances for metric optimization problems |
scientific article; zbMATH DE number 6209973
- Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Random shortest paths: non-Euclidean instances for metric optimization problems |
scientific article; zbMATH DE number 6209973 |
|
Statements
Random shortest paths: non-Euclidean instances for metric optimization problems (English)
0 references
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems (English)
0 references
3 September 2015
0 references
20 September 2013
0 references
random shortest paths
0 references
first passage percolation
0 references
approximation algorithms
0 references
random metrics
0 references
0 references
0 references
0 references
0 references
