Change search
ReferencesLink to record
Permanent link

Direct link
Efficient algorithms for k maximum sums
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
2004 (English)In: Algorithms and Computation: 15th International Symposium, ISAAC 2004 / [ed] Rudolf Fleischer; Gerhard Trippen, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2004, 137-148 p.Conference paper (Refereed)
Abstract [en]

We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers (x1,x2,⋯,xn) and an integer parameter k, l ≤ k ≤ 1/2n(n -1), the problem involves finding the k largest values of Σl=ij xl for 1 ≤ i ≤ j ≤ n. The problem for fixed k = 1, also known as the maximum sum subsequence problem, has received much attention in the literature and is linear-time solvable. Recently, Bae and Takaoka presented a θ(nk)-time algorithm for the k maximum sum subsequences problem. In this paper, we design efficient algorithms that solve the above problem in O (min{k + n log2 n, n √k}) time in the worst case. Our algorithm is optimal for k ≥ n log2 n and improves over the previously best known result for any value of the user-defined parameter k. Moreover, our results are also extended to the multi-dimensional versions of the k maximum sum subsequences problem; resulting in fast algorithms as well

Place, publisher, year, edition, pages
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2004. 137-148 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3341
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-35524DOI: 10.1007/b104582Local ID: a13f3f40-7beb-11dc-a72d-000ea68e967bISBN: 978-3-540-24131-7OAI: oai:DiVA.org:ltu-35524DiVA: diva2:1008777
Conference
International Symposium on Algorithms and Computation : 20/12/2004 - 22/12/2004
Note
Validerad; 2004; 20071016 (bson)Available from: 2016-09-30 Created: 2016-09-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Bengtsson, FredrikChen, Jingsen
By organisation
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 1 hits
ReferencesLink to record
Permanent link

Direct link