Efficient Algorithms for k Maximum Sums

  • Fredrik Bengtsson
  • Jingsen Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3341)


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, \(1\leq k \leq \frac{1}{2}n(n-1)\), the problem involves finding the k largest values of \(\sum\limits^{j}_{\ell=i}x_{\ell}\) for 1 ≤ ijn. 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{\rm log}^{2}n,n\sqrt{k}\})\) time in the worst case. Our algorithm is optimal for kn log2n 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Weiss, M.: Data Structures and Algorithm Analysis, 2nd edn. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  2. 2.
    Bentley, J.: Programming pearls: Algorithm design techniques. Communications of the ACM 27, 865–871 (1985)CrossRefGoogle Scholar
  3. 3.
    Grenander, U.: Pattern Analysis. Springer-Verlag, New York (1978)MATHGoogle Scholar
  4. 4.
    Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)Google Scholar
  5. 5.
    Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 13–23 (1996)Google Scholar
  6. 6.
    Bentley, J.: Programming pearls: Perspective on performance. Communications of the ACM 27, 1087–1092 (1985)CrossRefGoogle Scholar
  7. 7.
    Gries, D.: A note on the standard strategy for developing loop invariants and loops. Science of Computer Programming 2, 207–214 (1982)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Smith, D.: Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming 8, 213–229 (1987)MATHCrossRefGoogle Scholar
  9. 9.
    Tamaki, H., Tokuyama, T.: Algorithms for the maximum subarray problem based on matrix multiplication. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 446–452 (1998)Google Scholar
  10. 10.
    Takaoka, T.: Efficient algorithms for the maximum subarray problem by distance matrix multiplication. In: Proceedings of the 2002 Australian Theory Symposium, pp. 189–198 (2002)Google Scholar
  11. 11.
    Akl, S., Guenther, G.: Application of broadcasting with selective reduction to the maximal sum subsegment problem. International Journal of High Speed Computing 3, 107–119 (1991)MATHCrossRefGoogle Scholar
  12. 12.
    Perumalla, K., Deo, N.: Parallel algorithms for maximum subsequence and maximum subarray. Parallel Processing Letters 5, 367–373 (1995)CrossRefGoogle Scholar
  13. 13.
    Qiu, K., Akl, S.: Parallel maximum sum algorithms on interconnection networks. Technical Report No. 99-431, Jodrey School of Computer Science, Acadia University, Canada (1999)Google Scholar
  14. 14.
    Bae, S.E., Takaoka, T.: Algorithms for the problem of k maximum sums and a VLSI algorithm for the k maximum subarrays problem. In: Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 247–253 (2004)Google Scholar
  15. 15.
    Frederickson, G., Johnson, D.: The complexity of selection and ranking in X + Y and matrices with sorted columns. Journal of Computer and System Sciences 24, 197–208 (1982)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Frederickson, G., Johnson, D.: Generalized selection and ranking: Sorted matrices. SIAM Journal on Computing 13, 14–30 (1984)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Riedewald, M., Agrawal, D., Abbadi, A.E.: Flexible data cubes for online aggregation. In: International Conference on Database Theory. LNCS, pp. 159–173. Springer, Heidelberg (2001)Google Scholar
  18. 18.
    Bengtsson, F., Chen, J.: Computing the k maximum subarrays fast. Technical Report No. 2004:07, Luleå University of Technology, Luleå, Sweden (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Fredrik Bengtsson
    • 1
  • Jingsen Chen
    • 1
  1. 1.Department of Computer Science and Electrical EngineeringLuleå University of TechnologyLuleåSweden

Personalised recommendations