Successive shortest paths in complete graphs with random edge weights (Q3386534)
From MaRDI portal
 | 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: Successive shortest paths in complete graphs with random edge weights |
scientific article; zbMATH DE number 7290206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Successive shortest paths in complete graphs with random edge weights |
scientific article; zbMATH DE number 7290206 |
Statements
Successive shortest paths in complete graphs with random edge weights (English)
0 references
5 January 2021
0 references
Dijkstra's algorithm
0 references
minimum-cost flow
0 references
optimization in random structures
0 references
robust optimization
0 references
second-cheapest structure
0 references
shortest path
0 references
0 references
0 references
0.94282055
0 references
0.9378849
0 references
0.93418187
0 references
0.90282065
0 references
0.88898194
0 references
0.8767315
0 references
0.87598073
0 references
0 references
0.8725548
0 references
0.8717518
0 references
