Abstract
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve \(O(n^3\sqrt{\log\log n/\log n} + k\log n)\) for a general problem where overlapping is allowed for solution arrays. This complexity is sub-cubic when k = o(n 3/logn). The best known complexities of this problem are O(n 3 + klogn), which is cubic when k = O(n 3/logn), and \(O(kn^3\sqrt{\log\log n/\log n})\), which is sub-cubic when \(k=o(\sqrt{\log n/\log\log n})\).
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bae, S.E., Takaoka, T.: Mesh algorithms for the K maximum subarray problem. In: Proc. ISPAN 2004, pp. 247–253 (2004)
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)
Bae, S.E., Takaoka, T.: Algorithms for K Disjoint Maximum Subarrays. In: Alexandrov, V.N., van Albada, G.D., 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)
Bae, S.E.: Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem, Ph. D Thesis submitted to University of Canterbury (April 2007)
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)
Bengtsson, F., Chen, J.: A Note on Ranking k Maximum Sums, Technical Report Lulea University LTE-FR-0508 (2005)
Bentley, J.: Programming Pearls - Perspective on Performance. Comm. ACM 27, 1087–1092 (1984)
Brodal, G.S., Jorgensen, A.G.: A Linear Time Algorithm for the k Maximal Sums Problem, private communication. Also MFCS (to appear, 2007)
Chan, T.M.: All pairs shortest paths with real weights in O(n 3/logn) time. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 318–324. Springer, Heidelberg (2005)
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)
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)
Dobosiewicz: A more efficient algorithm for min-plus multiplication. Internt. J. Comput. Math. 32, 49–60 (1990)
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)
Fredman, M.: New bounds on the complexity of the shortest path problem. SIAM Jour. Computing 5, 83–89 (1976)
Han, Y.: Improved algorithms for all pairs shortest paths. Info. Proc. Lett. 91, 245–250 (2004)
Han, Y.: An O(n 3(loglogn/logn)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)
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)
Takaoka, T.: A New Upper Bound on the complexity of the all pairs shortest path problem. Info. Proc. Lett. 43, 195–199 (1992)
Takaoka, T.: Sub-cubic algorithms for the maximum subarray problem. In: Proc. Computing:Australasian Theory Symposium (CATS 2002), pp. 189–198 (2002)
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)
Takaoka, T.: An O(n 3loglogn/logn) Time Algorithm for the All Pairs Shortest Path Problem. Info. Proc. Lett. 96, 155–161 (2005)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bae, S.E., Takaoka, T. (2007). A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem. In: Tokuyama, T. (eds) Algorithms and Computation. ISAAC 2007. Lecture Notes in Computer Science, vol 4835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77120-3_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-77120-3_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77118-0
Online ISBN: 978-3-540-77120-3
eBook Packages: Computer ScienceComputer Science (R0)