Tien-Ching Lin, D. T. Lee. Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. In Tetsuo Asano, editor, Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings. Volume 4288 of Lecture Notes in Computer Science, pages 460-473, Springer, 2006. [doi]
@inproceedings{LinL06:4,
title = {Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem},
author = {Tien-Ching Lin and D. T. Lee},
year = {2006},
doi = {10.1007/11940128_47},
url = {http://dx.doi.org/10.1007/11940128_47},
researchr = {https://researchr.org/publication/LinL06%3A4},
cites = {0},
citedby = {0},
pages = {460-473},
booktitle = {Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings},
editor = {Tetsuo Asano},
volume = {4288},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-49694-7},
}