On finding connected balanced partitions of trees

DOI10.1016/j.dam.2021.04.002zbMath1469.90120OpenAlexW3157697337MaRDI QIDQ2028065

Isabella Lari, Maurizio Bruglieri, Federica Ricca, Andrea Scozzari, Roberto Cordone

Publication date: 31 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2434/849661

zbMATH Keywords

connected partitioning of treesmin-max gap optimizationmin-sum gap optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Cardinality constrained connected balanced partitions of trees under different criteria ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions

Cites Work

• Unnamed Item
• Partitioning a graph into minimum gap components
• Algorithms for uniform centered partitions of trees
• Selection in \(X+Y\) and matrices with sorted rows and columns
• Computing sharp bounds for hard clustering problems on trees
• Clustering on trees
• Uniform and most uniform partitions of trees
• Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty
• Algorithms and complexity of range clustering
• Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria
• Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs

This page was built for publication: On finding connected balanced partitions of trees