Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem

DOI10.1007/11940128_47MaRDI QIDQ5459141zbMATH OpenOpenAlexFDO

Authors Tien-Ching Lin, Der-Tsai Lee

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_47

zbMATH Keywords

maximum sum problemsum selection problemmaximum sum subarray problemk maximum sums problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
• Algorithms and Computation
• Randomized algorithm for the sum selection problem
• Ranking \(k\) maximum sums
• Efficient algorithms for \(k\) maximum sums

Cited in

(12)

• Finding maximum sum segments in sequences with uncertainty
• Finding maximum sum segments in sequences with uncertainty
• Algorithms and Computation
• Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
• Randomized algorithm for the sum selection problem
• Ranking \(k\) maximum sums
• Efficient algorithms for the maximum sum problems
• Algorithms and Computation
• Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
• Selecting Sums in Arrays
• Minimizing the sum of the \(k\) largest functions in linear time.
• Optimal algorithms for the average-constrained maximum-sum segment problem

This page was built for publication: Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem

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