Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2849911
aliases / en / 0aliases / en / 0
 
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems
description / endescription / en
 
scientific article; zbMATH DE number 6209973
Property / title
 
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems (English)
Property / title: Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1319.90071 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-40313-2_21 / rank
 
Normal rank
Property / published in
 
Property / published in: Mathematical Foundations of Computer Science 2013 / rank
 
Normal rank
Property / publication date
 
20 September 2013
Timestamp+2013-09-20T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 20 September 2013 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6209973 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1553564394 / rank
 
Normal rank

Revision as of 12:42, 29 April 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
  • Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems

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
0 references
0 references
0 references
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

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references