|
|||||
|
|
A tight bound on the min-ratio edge-partitioning problem of a tree |
|
| Authors: | An-Chiang Chu |
| Institution: | a Department of Computer Science and Information Engineering, National Taiwan University, Taipei, 106, Taiwan b Graduate Institute of Biomedical Electronics and Bioinformatics, National Taiwan University, Taipei, 106, Taiwan c Graduate Institute of Networking and Multimedia, National Taiwan University, Taipei, 106, Taiwan d Department of Computer Science and Information Engineering, National Chung Cheng University, Min-Hsiung, Chiayi, 621, Taiwan |
| 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. |
| Keywords: | Tree Partition Optimization problem Algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ | |