Issue No. 11 - November (1995 vol. 44)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.475128
<p><it>Abstract</it>—We consider the problem of partitioning a sequence of <it>n</it> real numbers into <it>p</it> intervals such that the cost of the most expensive interval, measured with a cost function <it>f</it> 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 <it>O</it>(<it>p</it>(<it>n</it>−<it>p</it>)), which is an improvement of a factor of log <it>p</it> compared to the previous best algorithm. A number of variants of the problem are also considered.</p>
Partitioning, dynamic programming, the MinMax problem, parallel processing, multiple regression.
B. Olstad and F. Manne, "Efficient Partitioning of Sequences," in IEEE Transactions on Computers, vol. 44, no. , pp. 1322-1326, 1995.