Issue No.11 - November (1979 vol.28)
U.I. Gupta , Department of Electrical Engineering and Computer Science, Northwestern University
Given a set of intervals (pairs of real numbers), we look at the problem of finding a minimal partition of this set such that no element of the partition contains two overlapping intervals. We exhibit a T(N log N) algorithm which is optimal. The problem has applications in LSI layout design and job scheduling.
analysis of algorithms, Channel-assignment problem, job scheduling, LSI layout design
D.T. Lee, U.I. Gupta, "An Optimal Solution for the Channel-Assignment Problem", IEEE Transactions on Computers, vol.28, no. 11, pp. 807-810, November 1979, doi:10.1109/TC.1979.1675260