Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194)
From MaRDI portal
scientific article; zbMATH DE number 5224057
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs |
scientific article; zbMATH DE number 5224057 |
Statements
Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (English)
0 references
8 January 2008
0 references
tree partitioning
0 references
generalized packing problem
0 references
\(-1,0,1\)-perfect matrices
0 references
maximum closure
0 references
dynamic programming
0 references
NP-complete problems
0 references
