A tight bound on the min-ratio edge-partitioning problem of a tree

Authors:
An-Chiang Chu;Bang Ye Wu;Hung-Lung Wang;Kun-Mao Chao
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, 106, Taiwan;Department of Computer Science and Information Engineering, National Chung Cheng University, Min-Hsiung, Chiayi, 621, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, 106, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, 106, Taiwan and Graduate Institute of Biomedical Electronics and Bioinformatics, National Taiwan Uni ...
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 10
Cited 1

Optimal algorithms for tree partitioning

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Most uniform path partitioning and its use in image processing

Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Max-Min Tree Partitioning

Journal of the ACM (JACM)
A Shifting Algorithm for Min-Max Tree Partitioning

Journal of the ACM (JACM)
A shifting algorithm for continuous tree partitioning

Theoretical Computer Science
A linear time algorithm for optimal tree sibling partitioning and approximation algorithms in Natix

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On the uniform edge-partition of a tree

Discrete Applied Mathematics
An algorithm for partitioning trees augmented with sibling edges

Information Processing Letters
New Upper Bounds on Continuous Tree Edge-Partition Problem

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation

A linear-time algorithm for finding an edge-partition with max-min ratio at most two

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, we study how to partition a tree into edge-disjoint subtrees of approximately the same size. Given a tree T with n edges and a positive integer k@?n, we design an algorithm to partition T into k edge-disjoint subtrees such that the ratio of the maximum number to the minimum number of edges of the subtrees is at most two. The best previous upper bound of the ratio is three, given by Wu et al. [B.Y. Wu, H.-L. Wang, S.-T. Kuan, K.-M. Chao, On the uniform edge-partition of a tree, Discrete Applied Mathematics 155 (10) (2007) 1213-1223]. Wu et al. also showed that for some instances, it is impossible to achieve a ratio better than two. Therefore, there is a lower bound of two on the ratio. It follows that the ratio upper bound attained in this paper is already tight.