A sub-cubic time algorithm for the k-maximum subarray problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4835 LNCS, Issue , 2007, Pages 751-762

  Bae, Sung Eun ^a   Takaoka, Tadao ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; RANDOM ACCESS STORAGE;

DISTANCE MATRIX MULTIPLICATION (DMM); OVERLAPPING; SUB-CUBIC TIME ALGORITHM;

PROBLEM SOLVING;

EID: 38149025505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_65     Document Type: Conference Paper

References (23)

1. Bae, S.E., Takaoka, T.: Mesh algorithms for the K maximum subarray problem. In: Proc. ISPAN 2004, pp. 247-253 (2004)
2. Bae, S.E., Takaoka, T.: Improved Algorithms for the K-Maximum Subarray Problem for Small K. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 621-631. Springer, Heidelberg (2005) Also in Computer Journal, 49(3), 358-374 (2006)
3. Bae, S.E., Takaoka, T.: Algorithms for K Disjoint Maximum Subarrays. In: Alexandrov, V.N., van Albada, CD., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2006. LNCS, vol. 3991, pp. 310-339. Springer, Heidelberg (2006) Also in IJFCS 18(2), 310-339 (2007)
4. Bae, S.E.: Sequential and Parallel Algorithms for the Generalized Maximum Sub-array Problem, Ph. D Thesis submitted to University of Canterbury (April 2007)
5. Bengtsson, F., Chen, J.: Efficient Algorithms for the k Maximum Sums. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 137-148. Springer, Heidelberg (2004)
6. Bengtsson, F., Chen, J.: A Note on Ranking k Maximum Sums, Technical Report Lulea University LTE-FR-0508 (2005)
7. Bentley, J.: Programming Pearls - Perspective on Performance. Comm. ACM 27, 1087-1092 (1984)
8. Brodal, G.S., Jorgensen, A.G.: A Linear Time Algorithm for the k Maximal Sums Problem, private communication. Also MFCS (to appear, 2007)
9. 3/ log n) time. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 318-324. Springer, Heidelberg (2005)
10. Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: 39th ACM Symposium on Theory of Computing (STOC), pp. 590-598 (2007)
11. Cheng, C., Cheng, K., Tien, W., Chao, K.: Improved algorithms for the k maximum sums problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 799-808. Springer, Heidelberg (2005)
12. Dobosiewicz: A more efficient algorithm for min-plus multiplication. Internt. J. Comput. Math. 32, 49-60 (1990)
13. Frederickson, G.N., Johnson, D.B.: The complexity of selection and ranking in X+Y and matrices with sorted rows and columns. JCSS 24, 197-208 (1982)
14. Fredman, M.: New bounds on the complexity of the shortest path problem. SIAM Jour. Computing 5, 83-89 (1976)
15. Han, Y.: Improved algorithms for all pairs shortest paths. Info. Proc. Lett. 91, 245-250 (2004)
16. 5/4) time algorithm for all pairs shortest paths. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 411-417. Springer, Heidelberg (2006)
17. Lin, T.C., Lee, D.T.: Randomized algorithm for the sum selection problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 515-523. Springer, Heidelberg (2005)
18. Takaoka, T.: A New Upper Bound on the complexity of the all pairs shortest path problem. Info. Proc. Lett. 43, 195-199 (1992)
19. Takaoka, T.: Sub-cubic algorithms for the maximum subarray problem. In: Proc. Computing:Australasian Theory Symposium (CATS 2002), pp. 189-198 (2002)
20. Takaoka, T.: A Faster Algorithm for the All Pairs Shortest Path Problem and its Application. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 278-289. Springer, Heidelberg (2004)
21. 3 log log n/ log n) Time Algorithm for the All Pairs Shortest Path Problem. Info. Proc. Lett. 96, 155-161 (2005)
22. Tamaki, H., Tokuyama, T.: Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication. In: Proceedings of the 9th SODA (Symposium on Discrete Algorithms), pp. 446-452 (1998)
23. Zwick, U.: A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 921-932. Springer, Heidelberg (2004)