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]

Authors

Mohammed Thaher

This author has not been identified. Look up 'Mohammed Thaher' in Google

Tadao Takaoka

This author has not been identified. Look up 'Tadao Takaoka' in Google