A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
From MaRDI portal
Publication:5387809
Recommendations
Cites work
- scientific article; zbMATH DE number 1303586 (Why is no real title available?)
- A Linear Time Algorithm for the k Maximal Sums Problem
- A more efficient algorithm for the min-plus multiplication
- A new upper bound on the complexity of the all pairs shortest path problem
- Algorithm for K Disjoint Maximum Subarrays
- Algorithms and Computation
- Algorithms and Computation
- Algorithms and Computation
- Algorithms and Data Structures
- An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths
- An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem
- Computing and Combinatorics
- Computing and Combinatorics
- Improved algorithm for all pairs shortest paths
- More algorithms for all-pairs shortest paths in weighted graphs
- New Bounds on the Complexity of the Shortest Path Problem
- Ranking \(k\) maximum sums
- The complexity of selection and ranking in X+Y and matrices with sorted columns
Cited in
(6)- Algorithms for the maximum subarray problem based on matrix multiplication
- Algorithm for K Disjoint Maximum Subarrays
- Efficient algorithms for the maximum subarray problem by distance matrix multiplication
- Computing and Combinatorics
- ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
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)
