Log in

Relevant bibliographies by topics / K-maximum Subarray Problem

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'K-maximum Subarray Problem'

Author: Grafiati

Published: 4 June 2021

Last updated: 10 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'K-maximum Subarray Problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "K-maximum Subarray Problem"

1

Bae, S. E. "Improved Algorithms for the K-Maximum Subarray Problem." Computer Journal 49, no. 3 (2005): 358–74. http://dx.doi.org/10.1093/comjnl/bxl007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

BAE, SUNG EUN, and TADAO TAKAOKA. "ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS." International Journal of Foundations of Computer Science 18, no. 02 (2007): 319–39. http://dx.doi.org/10.1142/s012905410700470x.

Full text

Abstract:

The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it. For K disjoint maximum subarrays, Ruzzo and Tompa gave an O(n) time solution for one-dimension. This solution is, however, difficult to extend to two-dimensions. While a trivial solution of O(Kn3) time is easily obtainable for a two-dimensional array of size n × n, little study has been undertaken to improve the time complexity. We first propose an O(n + K log K) time solution for one-dimension. This is asymptotically equivalent to Ruzzo and Tompa's when sorted order is needed. Based on th

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "K-maximum Subarray Problem"

1

Lee, Sang Myung (Chris). "Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem." Thesis, University of Canterbury. Computer Science and Software Engineering, 2011. http://hdl.handle.net/10092/6494.

Full text

Abstract:

The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it. This problem was first introduced by Grenander and brought to computer science by Bentley in 1984. This problem has been branched out into other problems based on their characteristics. k-overlapping maximum subarray problem where the overlapping solutions are allowed, and k-disjoint maximum subarray problem where all the solutions are disjoint from each other are those. For k-overlapping maximum subarray problems, significant improvement have been made since the problem was first introduc

APA, Harvard, Vancouver, ISO, and other styles

2

Bashar, Mohammad Ehsanul. "Average case analysis of algorithms for the maximum subarray problem." Thesis, University of Canterbury. Computer Science and Software Engineering, 2007. http://hdl.handle.net/10092/1194.

Full text

Abstract:

Maximum Subarray Problem (MSP) is to find the consecutive array portion that maximizes the sum of array elements in it. The goal is to locate the most useful and informative array segment that associates two parameters involved in data in a 2D array. It's an efficient data mining method which gives us an accurate pattern or trend of data with respect to some associated parameters. Distance Matrix Multiplication (DMM) is at the core of MSP. Also DMM and MSP have the worst-case complexity of the same order. So if we improve the algorithm for DMM that would also trigger the improvement of MSP. Th

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "K-maximum Subarray Problem"

1

Bae, Sung E., and Tadao Takaoka. "Improved Algorithms for the K-Maximum Subarray Problem for Small K." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11533719_63.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "K-maximum Subarray Problem"

1

Sung Eun Bae and Tadao Takaoka. "Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem." In 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. IEEE, 2004. http://dx.doi.org/10.1109/ispan.2004.1300488.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!