Shifting Algorithms for Tree Partitioning with General Weighting Functions
暂无分享,去创建一个
Abstract Recently two shifting algorithms were designed for two optimum tree partitioning problems: The problem of max-min q -partition [4] and the problem of min-max q -partition [1]. In this work we investigate the applicability of these two algorithms to max-min and min-max partitioning of a tree for various different weighting functions. We define the families of basic and invariant weighting functions. It is shown that the first shifting algorithm yields a max-min q -partition for every basic weighting function. The second shifting algorithm yields a min-max q -partition for every invariant weighting function. In addition a modification of the second algorithm yields a min-max q -partition for the noninvariant diameter weighting function.
[1] Yehoshua Perl,et al. Circuit partitioning with size and connection constraints , 1983, Networks.
[2] Stephen R. Schach,et al. A Shifting Algorithm for Min-Max Tree Partitioning , 1980, JACM.
[3] Stephen R. Schach,et al. Max-Min Tree Partitioning , 1981, JACM.
[4] Frank Harary,et al. Graph Theory , 2016 .
[5] Y. Shiloach,et al. Efficient Optimization of Monotonic Functions on Trees , 1983 .