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

DOI10.1007/11940128_47zbMath1135.68631OpenAlexW2149096461MaRDI QIDQ5459141

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)

Related Items (2)

Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence ⋮ 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