Approximating minimum bounded degree spanning trees to within one of optimal (Q3549667)
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 bounded degree spanning trees to within one of optimal |
scientific article; zbMATH DE number 5485503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating minimum bounded degree spanning trees to within one of optimal |
scientific article; zbMATH DE number 5485503 |
Statements
Approximating minimum bounded degree spanning trees to within one of optimal (English)
0 references
5 January 2009
0 references
minimum bounded degree spanning tree problem
0 references
iterative rounding method
0 references
