This Article 
 Bibliographic References 
 Add to: 
Efficient Partitioning of Sequences
November 1995 (vol. 44 no. 11)
pp. 1322-1326

Abstract—We consider the problem of partitioning a sequence of n real numbers into p intervals such that the cost of the most expensive interval, measured with a cost function f is minimized. This problem is of importance for the scheduling of jobs both in parallel and pipelined environments. We develop a straightforward and practical dynamic programming algorithm that solves this problem in time O(p(np)), which is an improvement of a factor of log p compared to the previous best algorithm. A number of variants of the problem are also considered.

[1] A. Aggarwal and J.K. Park,“Improved algorithms for economic lot size problems,” Operations Research, vol. 41, pp. 549-571, 1993.
[2] S. Anily and A. Federgruen,“Structured partitioning problems,” Operations Research, vol. 13, pp. 130-149, 1991.
[3] S.H. Bokhari, "Partitioning Problems in Parallel, Pipelined and Distributed Computing," IEEE Trans. Computers, vol. 37, no. 1, pp. 48-57, Jan. 1988.
[4] G.N. Frederickson,“Optimal algorithms for partitioning trees and locating p-centers in trees,” Technical Report CSD-TR-1029, Purdue Univ., 1990.
[5] G.N. Frederickson,“Optimal algorithms for partitioning trees and locating p-centers in trees,” Proc. Second ACM-SIAM Symp. Discrete Algorithms, pp. 168-177,San Francisco, 1991.
[6] M.R. Garey and D.S. Johnson,Computers and Intractability. Freeman, 1979.
[7] F. Halsall,Data Communications, Computer Networks and OSI.Reading, Mass.: Addison Wesley, 1988.
[8] P. Hansen and K.-W. Lih,“Improved algorithms for partitioning problems in parallel, pipelined, and distributed computing,” IEEE Trans. Computers, vol. 41, pp. 769-771, 1992.
[9] W. Press,B. Flannery,S. Teukolsky,, and W. Vetterling,Numerical Recipes in Pascal. Cambridge Univ. Press, 1989.
[10] F. Manne,“Load balancing in parallel sparse matrix computations,” PhD thesis, Univ. of Bergen, Norway, 1993.
[11] F. Manne and T. Sørevik,“Optimal partitioning of sequences,” Tech. Report CS-92-62, Univ. of Bergen, Norway, 1992.
[12] B. Olstad and H.E. Tysdahl,“Improving the computational complexity of active contour algorithms,” Proc. Eighth Scandinavian Conf. Image Analysis, Tromsø, Norway, 1993.
[13] F.F. Yao,“Speed-up in dynamic programming,” SIAM J. Alg. Discrete Meth., vol. 3, pp. 532-540, 1982.

Index Terms:
Partitioning, dynamic programming, the MinMax problem, parallel processing, multiple regression.
Fredrik Manne, Bjørn Olstad, "Efficient Partitioning of Sequences," IEEE Transactions on Computers, vol. 44, no. 11, pp. 1322-1326, Nov. 1995, doi:10.1109/12.475128
Usage of this product signifies your acceptance of the Terms of Use.