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. U.I. Gupta, D.T. Lee, J.Y.-T. Leung, "An Optimal Solution for the Channel-Assignment Problem", IEEE Transactions on Computers, vol.28, no. 11, pp. 807-810, November 1979...
Publication » An Optimal Solution for the Channel-Assignment Problem. Article. An Optimal Solution for the Channel-Assignment Problem. U.I. Gupta. D. T. Lee. J.Y.-T. Leung. Department of Electrical Engineering and Computer Science. Further Comments on An Optimal Solution for the Channel- Assignment Problem. F. Rubin. D. T. Lee. National Chung Hsing University © 2008‐2015 researchgate.net. All rights reserved.
An Optimal Solution For The Channel-assignment Problem Synonym
Publication » An optimal solution to the “Philadelphia” channel assignment problem.
An Optimal Solution for the Channel-Assignment Problem
- Analysis of algorithms, Channel-assignment problem, job scheduling, LSI layout design.
- An alert was just sent to the Computer Society Digital Library (CSDL) department and we will restore this missing publication as soon as possible.
- 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.