https://scholars.lib.ntu.edu.tw/handle/123456789/488634
標題: | Disjoint Segments with Maximum Density. | 作者: | Chen, Yen Hung Tang, Chuan Yi HSUEH-I LU |
公開日期: | 2005 | 起(迄)頁: | 845-850 | 來源出版物: | Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part II | 摘要: | Given a sequence A of numbers and two positive integers ℓ and k, we study the problem to find k disjoint segments of A, each has length at least ℓ, such that their sum of densities is maximized. We give the first known polynomial-time algorithm for the problem: For general k, our algorithm runs in O(nℓk] time. For the special case with k = 2 (respectively, k = 3), we also show how to solve the problem in O(n) (respectively, O(n + ℓ2)} time. © Springer-Verlag Berlin Heidelberg 2005. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-25144447690&doi=10.1007%2f11428848_108&partnerID=40&md5=aaeba39284e10f2bb5943590e60d1f24 | DOI: | 10.1007/11428848_108 | SDG/關鍵字: | Algorithms; Problem solving; Polynomial approximation; Disjoint segments; Polynomial-time algorithms; Maximum density; Positive integers; Polynomials; Problem solving |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。