A Linear Time Algorithm for the k Maximal Sums Problem
GS Brodal, AG Jørgensen - … Foundations of Computer Science 2007: 32nd …, 2007 - Springer
Finding the sub-vector with the largest sum in a sequence of n numbers is known as the
maximum sum problem. Finding the k sub-vectors with the largest sums is a natural …
maximum sum problem. Finding the k sub-vectors with the largest sums is a natural …
Improved Algorithms for the K-Maximum Subarray Problem: Reviewers who have agreed to review between 1 January 2005 and 31 December 2005 for The …
The maximum subarray problem is to find the contiguous array elements having the largest
possible sum. We extend this problem to find K maximum subarrays. For general K …
possible sum. We extend this problem to find K maximum subarrays. For general K …
Sequential and parallel algorithms for the generalized maximum subarray problem
SE Bae - 2007 - ir.canterbury.ac.nz
The maximum subarray problem (MSP) involves selection of a segment of consecutive array
elements that has the largest possible sum over all other segments in a given array. The …
elements that has the largest possible sum over all other segments in a given array. The …
Improved algorithms for the k maximum-sums problems
CH Cheng, KY Chen, WC Tien, KM Chao - Theoretical Computer Science, 2006 - Elsevier
Given a sequence of n real numbers and an integer k, 1⩽ k⩽ 12n (n-1), the k maximum-sum
segments problem is to locate the k segments whose sums are the k largest among all …
segments problem is to locate the k segments whose sums are the k largest among all …
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence
HF Liu, KM Chao - Theoretical computer science, 2008 - Elsevier
Theoretical Computer Science Algorithms for finding the weight-constrained k longest paths
in a tree and the length-constrained Page 1 Theoretical Computer Science 407 (2008) 349–358 …
in a tree and the length-constrained Page 1 Theoretical Computer Science 407 (2008) 349–358 …
Analysis of air pollution (PM10) and respiratory morbidity rate using K-maximum sub-array (2-D) algorithm
K Fukuda, T Takaoka - Proceedings of the 2007 ACM symposium on …, 2007 - dl.acm.org
Air pollution is known to cause adverse effects on human health. While epidemiological
studies generally involve statistical/geographical approaches, the use of computer …
studies generally involve statistical/geographical approaches, the use of computer …
Computing maximum-scoring segments in almost linear time
F Bengtsson, J Chen - International Computing and Combinatorics …, 2006 - Springer
Given a sequence, the problem studied in this paper is to find a set of k disjoint continuous
subsequences such that the total sum of all elements in the set is maximized. This problem …
subsequences such that the total sum of all elements in the set is maximized. This problem …
[BOG][B] Computing maximum-scoring segments optimally
F Bengtsson, J Chen - 2007 - diva-portal.org
Given a sequence of length n, the problem studied in this paper is to find a set of k disjoint
subsequences of consecutive elements such that the total sum of all elements in the set is …
subsequences of consecutive elements such that the total sum of all elements in the set is …
Algorithm for K Disjoint Maximum Subarrays
The maximum subarray problem is to find the array portion that maximizes the sum of array
elements in it. For K disjoint maximum subarrays, Ruzzo and Tompa gave an O (n) time …
elements in it. For K disjoint maximum subarrays, Ruzzo and Tompa gave an O (n) time …
Ranking k maximum sums
F Bengtsson, J Chen - Theoretical Computer Science, 2007 - Elsevier
Given a sequence of n real numbers and an integer parameter k, the problem studied in this
paper is to compute k subsequences of consecutive elements with the sums of their …
paper is to compute k subsequences of consecutive elements with the sums of their …