On finding connected balanced partitions of trees
Authors:
- Maurizio BruglieriMBMaurizio Bruglieri
- Roberto CordoneRCRoberto Cordone
- Isabella LariILIsabella Lari
- Federica RiccaFRFederica Ricca
- Andrea ScozzariAndrea Scozzari
- 1 August 2021
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 299, 1-16
Abstract
No abstract availableKeywords
Funding Information
- Government of Andalusia Ministry of Economy Science Innovation and Employment
This publication has 12 references indexed in Scilit:
- Uniform and most uniform partitions of treesDiscrete Optimization, 2018
- Algorithms for uniform centered partitions of treesElectronic Notes in Discrete Mathematics, 2016
- Partitioning a graph into minimum gap componentsElectronic Notes in Discrete Mathematics, 2016
- Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteriaNetworks, 2015
- Different Design Criteria for District Metered Areas in Water Distribution NetworksProcedia Engineering, 2015
- Optimal Design of District Metered Areas in Water Distribution NetworksProcedia Engineering, 2014
- Computing sharp bounds for hard clustering problems on treesDiscrete Applied Mathematics, 2009
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costsNetworks, 2007
- Clustering on treesComputational Statistics & Data Analysis, 1997
- Selection in X + Y and matrices with sorted rows and columnsInformation Processing Letters, 1985