On finding connected balanced partitions of trees

DOI10.1016/J.DAM.2021.04.002MaRDI QIDQ2028065zbMATH OpenOpenAlexFDO

Authors Maurizio Bruglieri, Isabella Lari, 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)

Recommendations

• Cardinality constrained connected balanced partitions of trees under different criteria
• Approximating the Maximally Balanced Connected Partition Problem in graphs
• Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
• Balanced partitions of trees and applications
• Partitioning a Weighted Tree to Subtrees of Almost Uniform Size

Cites work

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

Cited in

(17)

• Optimal partition of a tree with social distance
• Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria
• Cardinality constrained connected balanced partitions of trees under different criteria
• Uniform and most uniform partitions of trees
• Balanced partitions of trees and applications
• Graph-Theoretic Concepts in Computer Science
• Connected graph partitioning with aggregated and non‐aggregated gap objective functions
• On the complexity of graph tree partition problems.
• Efficient algorithms for a graph partitioning problem
• Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
• Balanced connected partitioning of unweighted grid graphs
• Algorithms for uniform centered partitions of trees
• Partitioning of biweighted trees
• Generating all patterns of graph partitions within a disparity bound
• Balanced tree partition problems with virtual nodes
• Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs
• Balanced partitions of trees and applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028065)