Ranking k maximum sums

DOI10.1016/J.TCS.2007.03.011MaRDI QIDQ884477zbMATH OpenOpenAlexFDO

Authors Fredrik Bengtsson, Jingsen Chen

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)

Recommendations

• Efficient algorithms for \(k\) maximum sums
• Algorithms and Computation
• Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
• Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
• Improved algorithms for the \(k\) maximum-sums problems

Cites work

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

Cited in

(10)

• Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence
• Algorithms and Computation
• Randomized algorithm for the sum selection problem
• Ranking \(k\) maximum sums
• On max-k-sums
• Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
• Selecting Sums in Arrays
• Efficient algorithms for \(k\) maximum sums
• A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
• Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884477)