An optimal solution for the channel-assignment problem
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 Θ (N log N) algorithm which is optimal. The problem has applications in LSI
layout design and job scheduling.
partition of this set such that no element of the partition contains two overlapping intervals.
We exhibit a Θ (N log N) algorithm which is optimal. The problem has applications in LSI
layout design and job scheduling.
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 Θ(N log N) algorithm which is optimal. The problem has applications in LSI layout design and job scheduling.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果