Efficient partitioning of sequences

Efficient partitioning of sequences

0.00 Avg rating0 Votes
Article ID: iaor19962240
Country: United States
Volume: 44
Issue: 11
Start Page Number: 1322
End Page Number: 1326
Publication Date: Nov 1995
Journal: IEEE Transactions on Computers
Authors: ,
Keywords: partitioning
Abstract:

The authors 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. The authors develop a straightforward and practical dynamic programming algorithm that solves this problem in time O(p(n-p)), which is an improvement of a factor of (logp) compared to the previous best algorithm. A number of variants of the problem are also considered.

Reviews

Required fields are marked *. Your email address will not be published.