Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (Q1686555)
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: Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length |
scientific article; zbMATH DE number 6819060
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length |
scientific article; zbMATH DE number 6819060 |
Statements
Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (English)
0 references
15 December 2017
0 references
\(K\)-tree
0 references
stock pieces of length \(L\)
0 references
approximation algorithms
0 references
APTAS
0 references
0 references
0 references
