Improved algorithms for the K-maximum subarray problem

Computer Journal

Volumn 49, Issue 3, 2006, Pages 358-374

  Bae, Sung Eun ^a   Takaoka, Tadao ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Distance matrix multiplication; Maximum subarray; Persistent 2 3 tree; Selection in matrices with sorted columns

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; MAXIMUM PRINCIPLE; ONE DIMENSIONAL; PROBLEM SOLVING; TIME DOMAIN ANALYSIS; TREES (MATHEMATICS);

DISTANCE MATRIX MULTIPLICATION; K-MAXIMUM SUBARRAY; PERSISTENT 2-3 TREE; TIME ALGORITHM;

COMPUTATIONAL COMPLEXITY;

EID: 33646256345     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxl007     Document Type: Article

References (28)

1. Bentley, J. (1984) Programming pearls: Algorithm design techniques. Commun. ACM, 27(9), 865-873.
2. Bentley, J. (1984) Programming pearls: Perspective on performance. Commun. ACM, 27(11), 1087-1092.
3. Takaoka, T. (1992) A new upper bound on the complexity of the all pairs shortest paths problem. Inform Process. Lett., 43(4), 195-199.
4. Tamaki, H. and Tokuyama, T. (1998) Algorithms for the maximum subarray problem based on matrix multiplication. In Proc. SODA 1998, San Francisco, CA, January 25-27, pp. 446-452. SIAM, Philadelphia, PA.
5. Takaoka, T. (2002) Efficient algorithms for the maximum subarray problem by distance matrix multiplication. In Proc. CATS 2002, Melbourne, Australia, January 28-February 1, ENTCS, 61, pp. 191-200. Elsevier, Amsterdam, The Netherlands.
6. Miller, R. and Boxer, L. (2000) Algorithms Sequential & Parallel - A Unified Approach. Prentice Hall, Upper Saddle River, NJ.
7. Perumalla, K. and Deo, N. (1995) Parallel algorithms for maximum subsequence and maximum subarray. Parallel Process. Lett., 5(3), 367-373.
8. Wen, Z. (1995) Fast parallel algorithms for the maximum sum problem. Parallel Comput., 21(3), 461-466.
9. Qui, K. and Aki, S. G. (1999) Parallel maximum sum algorithms on interconnection networks. Department Computing and Information Science, Queen's University, Kingston, Ontario, Canada.
10. Bae, S. E. and Takaoka, T. (2003) Parallel approaches to the maximum subarray problem. In Proc. Japan-Korea Workshop on Algorithms and Computation 2003, Sendai, Japan, July 3-4, pp. 94-104. Tohoku University, Sendai, Japan.
11. Bae, S. E. and Takaoka, T. (2004) Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem. In Proc. ISPAN 2004, Hong Kong, May 10-12, pp. 247-253. IEEE Computer Soceity Press, Los Alamitos, CA.
12. Bengtsson, F. and Chen, J. (2004) Efficient algorithms for the k maximum sums. In Proc. ISAAC 2004, Hong Kong, December 20-22, LNCS, 3341, pp. 137-148. Springer-Verlag, Berlin.
13. Bae, S. E. and Takaoka, T. (2005) Improved algorithms for the K-maximum subarray problem for small K. In Proc. COCOON 2005, Kunming, Yunnan, China, August 16-19, pp. 621-631. Springer-Verlag, Berlin.
14. Driscoll, J. R., Samak, N., Sleator, D. D. and Tarjan, R. E. (1986) Making data structures persistent. In Proc. ACM STOC'86, May 28-30, Berkeley, CA, pp. 109-121. ACM Press, New York, NY.
15. Frederickson, G. N. and Johnson, D. B. (1982) The complexity of selection and ranking in X+Y and matrices with sorted columns. J. Comput. Syst. Sci., 24, 197-208.
16. Takaoka, T. (2004) A faster algorithm for the all-pairs shortest path problem and its application. In Proc. COCOON 2004, Jeju Island, Korea, August 17-20, LNCS, 4106, pp. 278-289. Springer-Verlag, Berlin.
17. Zwick, U. (2004) A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. In Proc. ISAAC 2004, Hong Kong, December 20-22, LNCS, 3341, pp. 921-932. Springer-Verlag, Berlin.
18. Blum, M., Floyd, R. W., Pratt, V. R., Rivest, R. L. and Tarjan, R. E. (1973) Time bounds for selection. J. Comput. Syst. Sci., 7(4), 448-461.
19. Aho, A. V., Hopcroft, J. E. and Ullman, J. D. (1974) The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA.
20. Knuth, D. E. (1998) The Art of Computer Programming. Addison-Wesley, Reading, MA.
21. Brodal, G. S. (1996) Partially persistent data structures of bounded degree with constant update time. Nordic J. Comput., 3(3), 238-255.
22. Becker, B., Gschwind, S., Ohier, T., Seeger, B. and Widmayer, P. (1996) An asymptotically optimal multiversion B-tree. VLDB J., 5, 264-275.
23. Sarnak, N. and Tarjan, R. E. (1986) Planar point location using persistent search trees. Commun. ACM, 29(7), 669-679.
24. Kaplan, H. and Tarjan, R. E. (1996) Purely functional representations of catenable sorted lists. In Proc. ACM STOC'96, Philadelphia, PA, May 22-24, pp. 202-211. ACM Press, New York, NY.
25. Brown, M. R. and Tarjan, R. E. (1980) The design and analysis of a data structure for representing sorted lists. SIAMJ. Comput., 9(3), 594-614.
26. Fredman, M. (1976) New bounds on the complexity of the shortest path problem. SIAM J. Comput., 5, 83-89.
27. Ruzzo, W. L. and Tompa, M. (1999) A linear time algorithm for finding all maximal scoring subsequences. In Proc. ISMB'99, Heidelberg, Germany, August 6-10, pp. 234-241. AAAI Press, Menio Park, CA.
28. Csürös, M. (2004) Algorithms for finding maxima-scoring segment sets. In Proc. WABI 2004, Bergen, Norway, September 14-17, LNCS, 3240, pp. 62-73. Springer-Verlag, Berlin.