A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
From MaRDI portal
Publication:5387809
DOI10.1007/978-3-540-77120-3_65zbMATH Open1155.68601OpenAlexW1543920729MaRDI QIDQ5387809FDOQ5387809
Authors: Sung Eun Bae, Tadao Takaoka 
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_65
Recommendations
Cites Work
- More algorithms for all-pairs shortest paths in weighted graphs
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem
- A new upper bound on the complexity of the all pairs shortest path problem
- Improved algorithm for all pairs shortest paths
- A more efficient algorithm for the min-plus multiplication
- New Bounds on the Complexity of the Shortest Path Problem
- Algorithms and Data Structures
- Algorithms and Computation
- A Linear Time Algorithm for the k Maximal Sums Problem
- Computing and Combinatorics
- An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths
- Algorithms and Computation
- Algorithms and Computation
- Title not available (Why is that?)
- Computing and Combinatorics
- Ranking \(k\) maximum sums
- Algorithm for K Disjoint Maximum Subarrays
Cited In (5)
- Algorithms for the maximum subarray problem based on matrix multiplication
- Computing and Combinatorics
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
- ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS
- Algorithm for K Disjoint Maximum Subarrays
This page was built for publication: A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387809)
