Efficient algorithms for \(k\) maximum sums
From MaRDI portal
Publication:2509030
DOI10.1007/s00453-006-0076-xzbMath1100.68124MaRDI QIDQ2509030
Fredrik Bengtsson, Jingsen Chen
Publication date: 16 October 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-006-0076-x
Related Items
Randomized algorithm for the sum selection problem, Ranking \(k\) maximum sums, Robust optimization in the presence of uncertainty: a generic approach, Efficient algorithms for the sum selection problem and \(k\) maximum sums problem, MINKOWSKI SUM SELECTION AND FINDING