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.
Algorithms for uniform centered partitions of trees / Lari, Isabella; PUERTO ALBANDOZ, Justo; Ricca, Federica; Scozzari, Andrea. - In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS. - ISSN 1571-0653. - ELETTRONICO. - 55/2016:(2016), pp. 37-40. [10.1016/j.endm.2016.10.010]
Algorithms for uniform centered partitions of trees
LARI, Isabella;RICCA, Federica;
2016
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.File allegati a questo prodotto
| File | Dimensione | Formato | |
|---|---|---|---|
|
Ricca_Algorithms-uniform_2016.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
165.24 kB
Formato
Adobe PDF
|
165.24 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
