Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179)
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: Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics |
scientific article; zbMATH DE number 7559389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics |
scientific article; zbMATH DE number 7559389 |
Statements
18 July 2022
0 references
\(k\)-hop Steiner tree
0 references
dynamic programming
0 references
bounded treewidth
0 references
0 references
0 references
0 references
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (English)
0 references
