Ranking \(k\) maximum sums

DOI10.1016/J.TCS.2007.03.011zbMath1117.68086OpenAlexW2077527465MaRDI QIDQ884477

Jingsen Chen, Fredrik Bengtsson

Publication date: 6 June 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.011

zbMATH Keywords

algorithm designmaximum sum subarraymaximum sum subsequence

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Related Items (2)

Ranking \(k\) maximum sums ⋮ A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Ranking \(k\) maximum sums
• A note on a standard strategy for developing loop invariants and loops
• Pattern analysis. Lectures in pattern theory. Vol. II
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Applications of a strategy for designing divide-and-conquer algorithms
• Efficient algorithms for \(k\) maximum sums
• Generalized Selection and Ranking: Sorted Matrices
• APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
• Computing and Combinatorics
• Algorithms and Computation

This page was built for publication: Ranking \(k\) maximum sums