Abstract
Given a sequence A of n real numbers and two positive integers l and k, where , the problem is to locate k disjoint segments of A, each has length at least l, such that their sum of densities is maximized. The best previously known algorithm, due to Bergkvist and Damaschke [1], runs in O(nl+k 2l 2) time. In this paper, we give an O(n+k 2llogl)-time algorithm. © 2006 Springer-Verlag Berlin/Heidelberg.
Cite
CITATION STYLE
Liu, H. F., & Chao, K. M. (2006). On locating disjoint segments with maximum sum of densities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4288 LNCS, pp. 300–307). https://doi.org/10.1007/11940128_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
