Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
From MaRDI portal
Publication:5459141
DOI10.1007/11940128_47zbMath1135.68631OpenAlexW2149096461MaRDI QIDQ5459141
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
Related Items
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