請用此 Handle URI 來引用此文件: http://hdl.handle.net/11455/38493
標題: An Optimal Solution for the Channel-Assignment Problem
作者: U.I.Gupta
D.T.Lee
J.Y.T.Leung
出版社: Computers, IEEE Transactions on (Volume:C-28 , Issue: 11 )
摘要: 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.
URI: http://hdl.handle.net/11455/38493
ISSN: 0018-9340
顯示於類別:資訊科學與工程學系所

文件中的檔案:
沒有與此文件相關的檔案。


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。