A linear programming approach to increasing the weight of all minimum spanning trees (Q3548723)
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: A linear programming approach to increasing the weight of all minimum spanning trees |
scientific article; zbMATH DE number 5383018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear programming approach to increasing the weight of all minimum spanning trees |
scientific article; zbMATH DE number 5383018 |
Statements
A linear programming approach to increasing the weight of all minimum spanning trees (English)
0 references
17 December 2008
0 references
minimum weight spanning trees
0 references
packing spanning trees
0 references
network reinforcement
0 references
strength problem
0 references
0.8515313267707825
0 references
0.7882220149040222
0 references
0.7733392119407654
0 references
0.7677013278007507
0 references
