A shifting algorithm for continuous tree partitioning

DOI10.1016/S0304-3975(01)00075-5zbMath1007.68205MaRDI QIDQ1850820

Bruno Simeone, Yen-I Chiang, Ronald I. Becker

Publication date: 12 December 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph partitioningtree partitioningcontinuous partitioningoptimization on trees

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

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 ⋮ Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches ⋮ Multi-period maintenance scheduling of tree networks with minimum flow disruption ⋮ Continuous bottleneck tree partitioning problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient implementation of a shifting algorithm
• Most uniform path partitioning and its use in image processing
• Max-Min Tree Partitioning
• A Shifting Algorithm for Min-Max Tree Partitioning
• Fair dissections of spiders, worms, and caterpillars