Partitioning a Weighted Tree to Subtrees of Almost Uniform Size

DOI10.1007/978-3-540-92182-0_20zbMath1183.05081OpenAlexW1523296541MaRDI QIDQ3596718

Xiao Zhou, Takeaki Uno, Takehiro Ito, Takao Nishizeki

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem ⋮ A tight bound on the min-ratio edge-partitioning problem of a tree ⋮ Partitioning a weighted tree into subtrees with weights in a given range ⋮ A linear-time algorithm for finding an edge-partition with max-min ratio at most two ⋮ Unnamed Item

This page was built for publication: Partitioning a Weighted Tree to Subtrees of Almost Uniform Size