Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Mohammed Thaher, Tadao Takaoka. An efficient algorithm for computing the K-overlapping maximum convex sum problem. Procedia CS, 4:1288-1295, 2011. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Improved algorithms for the K overlapping maximum convex sum problemMohammed Thaher, Tadao Takaoka. iccs 2012: 754-763 [doi] An efficient parallel algorithm for the maximum convex sum problemSung Eun Bae, Tong-Wook Shinn, Tadao Takaoka. acsc 2016: 23 [doi] An efficient algorithm for the k maximum convex sumsMohammed Thaher, Tadao Takaoka. procedia, 1(1):1475-1483, 2010. [doi]
The following publications are possibly variants of this publication: