The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818)
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: The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. |
scientific article; zbMATH DE number 1985921
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. |
scientific article; zbMATH DE number 1985921 |
Statements
The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (English)
0 references
25 September 2003
0 references
