Matches in SemOpenAlex for { <https://semopenalex.org/work/W2797200253> ?p ?o ?g. }
Showing items 1 to 81 of
81
with 100 items per page.
- W2797200253 abstract "Given an array A of n real numbers, the maximum subarray problem is to find a contiguous subarray which has the largest sum. The k-maximum subarrays problem is to find k such subarrays with the largest sums. For the 1-maximum subarray the well known divide-and-conquer algorithm, presented in most textbooks, although suboptimal, is easy to implement and can be made optimal with a simple change that speeds up the combine phase. On the other hand, the only known divide-and-conquer algorithm for k > 1, that is efficient for small values of k, is difficult to implement, due to the intricacies of the combine phase. In this paper we give a divide- and-conquer solution for the k-maximum subarray problem that simplifies the combine phase considerably while preserving the overall running time. In the process of designing the combine phase of the algorithm we provide a simple, sublinear, O($k^{1/2} log^3 k$) time algorithm, for finding the k largest sums of X + Y, where X and Y are sorted arrays of size n and $k <= n^2$. The k largest sums are implicitly represented, and can be enumerated with an additional O(k) time. To our knowledge, this is the first sublinear time algorithm for this well studied problem. Unlike previous solutions, that are fairly complicated and sometimes difficult to implement, ours rely on simple operations such as merging sorted arrays, binary search, and selecting the $k^{th}$ smallest number in an array. We have implemented our algorithms and report excellent performance on test data." @default.
- W2797200253 created "2018-04-24" @default.
- W2797200253 creator A5078438902 @default.
- W2797200253 creator A5086447656 @default.
- W2797200253 date "2018-04-16" @default.
- W2797200253 modified "2023-09-27" @default.
- W2797200253 title "k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler" @default.
- W2797200253 cites W1614891563 @default.
- W2797200253 cites W2019315437 @default.
- W2797200253 cites W2060164640 @default.
- W2797200253 cites W2136003390 @default.
- W2797200253 cites W2171589207 @default.
- W2797200253 cites W2752885492 @default.
- W2797200253 hasPublicationYear "2018" @default.
- W2797200253 type Work @default.
- W2797200253 sameAs 2797200253 @default.
- W2797200253 citedByCount "0" @default.
- W2797200253 crossrefType "posted-content" @default.
- W2797200253 hasAuthorship W2797200253A5078438902 @default.
- W2797200253 hasAuthorship W2797200253A5086447656 @default.
- W2797200253 hasConcept C111472728 @default.
- W2797200253 hasConcept C111919701 @default.
- W2797200253 hasConcept C11413529 @default.
- W2797200253 hasConcept C114614502 @default.
- W2797200253 hasConcept C117160843 @default.
- W2797200253 hasConcept C118615104 @default.
- W2797200253 hasConcept C121332964 @default.
- W2797200253 hasConcept C138885662 @default.
- W2797200253 hasConcept C2780586882 @default.
- W2797200253 hasConcept C33923547 @default.
- W2797200253 hasConcept C41008148 @default.
- W2797200253 hasConcept C44280652 @default.
- W2797200253 hasConcept C48372109 @default.
- W2797200253 hasConcept C62520636 @default.
- W2797200253 hasConcept C71559656 @default.
- W2797200253 hasConcept C94375191 @default.
- W2797200253 hasConcept C98045186 @default.
- W2797200253 hasConceptScore W2797200253C111472728 @default.
- W2797200253 hasConceptScore W2797200253C111919701 @default.
- W2797200253 hasConceptScore W2797200253C11413529 @default.
- W2797200253 hasConceptScore W2797200253C114614502 @default.
- W2797200253 hasConceptScore W2797200253C117160843 @default.
- W2797200253 hasConceptScore W2797200253C118615104 @default.
- W2797200253 hasConceptScore W2797200253C121332964 @default.
- W2797200253 hasConceptScore W2797200253C138885662 @default.
- W2797200253 hasConceptScore W2797200253C2780586882 @default.
- W2797200253 hasConceptScore W2797200253C33923547 @default.
- W2797200253 hasConceptScore W2797200253C41008148 @default.
- W2797200253 hasConceptScore W2797200253C44280652 @default.
- W2797200253 hasConceptScore W2797200253C48372109 @default.
- W2797200253 hasConceptScore W2797200253C62520636 @default.
- W2797200253 hasConceptScore W2797200253C71559656 @default.
- W2797200253 hasConceptScore W2797200253C94375191 @default.
- W2797200253 hasConceptScore W2797200253C98045186 @default.
- W2797200253 hasLocation W27972002531 @default.
- W2797200253 hasOpenAccess W2797200253 @default.
- W2797200253 hasPrimaryLocation W27972002531 @default.
- W2797200253 hasRelatedWork W1498797582 @default.
- W2797200253 hasRelatedWork W1589128031 @default.
- W2797200253 hasRelatedWork W1905750377 @default.
- W2797200253 hasRelatedWork W1943841886 @default.
- W2797200253 hasRelatedWork W1965787951 @default.
- W2797200253 hasRelatedWork W1971297816 @default.
- W2797200253 hasRelatedWork W1994855795 @default.
- W2797200253 hasRelatedWork W2003474472 @default.
- W2797200253 hasRelatedWork W2089062581 @default.
- W2797200253 hasRelatedWork W2100751585 @default.
- W2797200253 hasRelatedWork W2404667728 @default.
- W2797200253 hasRelatedWork W2754152676 @default.
- W2797200253 hasRelatedWork W2778011690 @default.
- W2797200253 hasRelatedWork W2799530285 @default.
- W2797200253 hasRelatedWork W3001026891 @default.
- W2797200253 hasRelatedWork W3010717744 @default.
- W2797200253 hasRelatedWork W3048196598 @default.
- W2797200253 hasRelatedWork W3112233629 @default.
- W2797200253 hasRelatedWork W3118287959 @default.
- W2797200253 hasRelatedWork W886683925 @default.
- W2797200253 isParatext "false" @default.
- W2797200253 isRetracted "false" @default.
- W2797200253 magId "2797200253" @default.
- W2797200253 workType "article" @default.