Approximating minimum-cost graph problems with spanning tree edges (Q1892100)
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: Approximating minimum-cost graph problems with spanning tree edges |
scientific article; zbMATH DE number 761908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating minimum-cost graph problems with spanning tree edges |
scientific article; zbMATH DE number 761908 |
Statements
Approximating minimum-cost graph problems with spanning tree edges (English)
0 references
6 July 1995
0 references
NP-hard minimum-cost graph problems
0 references
minimum-cost spanning tree
0 references
2- matching
0 references
location-routing problems
0 references
0.92723906
0 references
0.92723906
0 references
0.9255531
0 references
0.9193096
0 references
0.9187107
0 references
0.9183305
0 references
