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

Mohammed Thaher, Tadao Takaoka (2011)

> Home

Details and statistics

DOI: 10.1016/J.PROCS.2011.04.139

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/procedia/ThaherT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/procedia/ThaherT11
Mohammed Thaher, Tadao Takaoka:
An efficient algorithm for computing the K-overlapping maximum convex sum problem. ICCS 2011: 1288-1295

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.