Improved algorithms for the K-maximum subarray problem for small K

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 621-631

  Bae, Sung E ^a   Takaoka, Tadao ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PROBLEM SOLVING; COMBINATORIAL MATHEMATICS;

ARRAY ELEMENTS; K-MAXIMUM SUBARRAY PROBLEM; TWO-DIMENSIONAL ARRAYS; MAXIMUM SUBARRAY PROBLEMS; SUB-ARRAYS; TIME COMPLEXITY;

ALGORITHMS;

EID: 26844487008     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_63     Document Type: Conference Paper

References (19)

1. Bae, S.E., Takaoka, T.: Parallel approaches to the maximum subarray problem. Japan-Korea Workshop on Al. and Comp. (2003) 94-104
2. Bae, S.E., Takaoka, T.: Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem. ISPAN 2004 (2004) 247-253
3. Bengtsson, F., Chen, J.: Efficient algorithms for the k maximum sums. ISAAC 2004 LNCS, Vol. 3341 Springer (2004) 137-148
4. Bentley, J.: Programming pearls: algorithm design techniques. Commun. ACM, Vol. 27(9) (1984) 865-873
5. Bentley, J.: Programming pearls: perspective on performance. Commun. ACM, Vol. 27(11) (1984) 1087-1092
6. Brodal, G.S.: Finger search trees with constant insertion time. SODA 1998 (1998) 540-549
7. Brown, M.R., Tarjan, R.E.: The design and analysis of a data structure for representing sorted lists. SIAM Jour. on Comp., Vol. 9(3) (1980) 594-614
8. Csürös, M.: Algorithms for finding maxima-scoring segment sets. WABI 2004 LNCS, Vol. 3240 Springer (2004) 62-73
9. Dietz, P.F., Raman, R.: A constant update time finger search tree. Inf. Process. Lett., Vol. 52(3) (1994) 147-154
10. Miller, R., Boxer, L.: Algorithms Sequential & Parallel- A Unified Approach. Prentice Hall, (2000)
11. Perumalla, K., Deo, N.: Parallel algorithms for maximum subsequence and maximum sub-array. Parallel Process. Lett., Vol. 5(3) (1995) 367-373
12. Qui, K., Akl, S.G.: Parallel maximum sum algorithms on intercommenction networks. Queen's Uni. Dept. of Com. and Info. Sci. Technical Report 99-431 (1999)
13. Ruzzo, W.L., Tompa, M.: A linear time algorithm for finding all maximal scoring subsequences. Intelligent Sys. in Molecular Biology (1999) 234-241
14. Takaoka, T.: A new upper bound on the complexity of the all pairs shortest paths problem. Inf. Process. Lett., Vol. 43(4) (1992) 195-199
15. Takaoka, T.: Efficient algorithms for the maximum subarray problem by distance matrix multiplication. Elec. Notes in Theoretical Computer Sci., Vol. 61 Elsevier (2002)
16. Takaoka, T.: A faster algorithm for the all-pairs shortest path problem and its application. COCOON 2004, LNCS, Vol. 4106 Springer (2004) 278-289
17. Tamaki, H., Tokuyama, T: Algorithms for the maximum subarray problem based on matrix multiplication. SODA 1998 (1998) 446-452
18. Wen, Z.: Fast parallel algorithms for the maximum sum problem. Parallel Computing, Vol. 21(3) (1995) 461-466
19. Zwick, U.: A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. ISAAC 2004, LNCS, Vol. 3341 Springer (2004) 921-932