Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Nicola Apollonio / rank | |||
| Property / author | |||
| Property / author: Isabella Lari / rank | |||
| Property / author | |||
| Property / author: Bruno Simeone / rank | |||
| Property / author | |||
| Property / author: Justo Puerto / rank | |||
Revision as of 14:13, 11 February 2024
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
