a shifting algorithm for constrained min-max partition on trees：约束最小-最大隔树的移位算法.pdfVIP

Discrete Applied Mathematics 45 (1993) 1-28 1 North-Holland A shifting algorithm for constrained min-max partition on trees Eliezer Agasi Department of Mathematics and Computer Science, Bar-Ilan University, Ramat Gan, Israel Ronald I. Becker Department ofMathematics,University of Cape Town. Cape Town, South Africa Yehoshua Per1 Institute jbr Integrated Systems, Department of Computer and Information Science, New Jersey Institute of Technology, Newark, NJ 07102, USA Received 19 October 1983 Revised 18 June 1991 Abstract Agasi, E., R.I. Becker and Y. Perl, A shifting algorithm for constrained min-max partition on trees, Discrete Applied Mathematics 45 (1993) I-28. Let T = (V,E) be a rooted tree with n edges. We associate nonnegative weight w(v) and size s(v) with each vertex Bin V. A q-partition of T into q connected components T,,T,,. .,T, is obtained by deleting k = q-l edges of T, 15 k i n. The weight W(T,) (or size S(T,)) of component T, is then the sum of the weights (sizes) of the vertices of T,. The height h(7) is the maximum number of edges of paths having one end at the root. If P is a partition with components T,,.,.,T, let I+‘, = max, ~, my W(T,). The following two problems are considered: (1) Size-constrained min-max problem: Find a q-partition of T for which W, is a minimum over al