| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777203 | Electronic Notes in Discrete Mathematics | 2016 | 4 Pages |
Abstract
In this paper we provide polynomial time algorithms for the problem of finding uniform centered partitions of a tree, that is, partitions that are as balanced as possible either w.r.t. the costs or to the weights of their components.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari,