Upgrading min-max spanning tree problem under various cost functions (Q1680539)
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: Upgrading min-max spanning tree problem under various cost functions |
scientific article; zbMATH DE number 6807600
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upgrading min-max spanning tree problem under various cost functions |
scientific article; zbMATH DE number 6807600 |
Statements
Upgrading min-max spanning tree problem under various cost functions (English)
0 references
16 November 2017
0 references
location problems
0 references
upgrading problems
0 references
min-max spanning tree
0 references
0 references
0.9116152
0 references
0.8964416
0 references
0.89545333
0 references
0.88811517
0 references
0.8868349
0 references
0.88144565
0 references
0.88029915
0 references
0.88001055
0 references
0.8781509
0 references
