The complexity of minimum ratio spanning tree problems (Q2574099)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2229904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of minimum ratio spanning tree problems |
scientific article; zbMATH DE number 2229904 |
Statements
The complexity of minimum ratio spanning tree problems (English)
0 references
16 November 2005
0 references
Combinatorial optimization
0 references
Fractional programming
0 references
NP-hard
0 references
0.8686683773994446
0 references
0.8539082407951355
0 references
0.8397417664527893
0 references
0.82086580991745
0 references
