Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58217268 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial Optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Evaluation and Optimization of Electoral Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A spanning tree heuristic for regional clustering / rank | |||
Normal rank | |||
Latest revision as of 14:51, 27 June 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
