An efficient algorithm for computing the K-overlapping maximum convex sum problem

Mohammed Thaher, Tadao Takaoka. An efficient algorithm for computing the K-overlapping maximum convex sum problem. Procedia CS, 4:1288-1295, 2011. [doi]

Bibliographies