Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1007/s00453-014-9901-9 / rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00453-014-9901-9 / rank | |||
Normal rank |
Latest revision as of 01:28, 28 December 2024
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