Algorithms for uniform centered partitions of trees

DOI10.1016/j.endm.2016.10.010zbMath1356.05110OpenAlexW2552622987MaRDI QIDQ510918

Andrea Scozzari, Federica Ricca, Isabella Lari, Justo Puerto

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.010

zbMATH Keywords

tree partitioninguniform partitionscentered partitionsflat costsmin-max criteria

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ On finding connected balanced partitions of trees

Cites Work

• Efficient implementation of a shifting algorithm
• The shifting algorithm technique for the partitioning of trees
• New Results on the Complexity of p-Centre Problems
• Max-Min Tree Partitioning
• 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: Algorithms for uniform centered partitions of trees