Abstract
AbstractGiven a sequence A of n real numbers and two positive integers l and k, where \(k \leq \frac{n}{l}\), 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 2 l 2) time. In this paper, we give an O(n+k 2 llogl)-time algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
