The minimum bounded-diameter spanning forest problem is log-approximable (Q3070855)
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 5842433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum bounded-diameter spanning forest problem is log-approximable |
scientific article; zbMATH DE number 5842433 |
Statements
28 January 2011
0 references
0.7909156680107117
0 references
0.7848677635192871
0 references
0.7831135988235474
0 references
0.7800335884094238
0 references
