{"id":"https://openalex.org/W2570190023","doi":"https://doi.org/10.3390/a10010005","title":"Efficient Algorithms for the Maximum Sum Problems","display_name":"Efficient Algorithms for the Maximum Sum Problems","publication_year":2017,"publication_date":"2017-01-04","ids":{"openalex":"https://openalex.org/W2570190023","doi":"https://doi.org/10.3390/a10010005","mag":"2570190023"},"language":"en","primary_location":{"id":"doi:10.3390/a10010005","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a10010005","pdf_url":"https://www.mdpi.com/1999-4893/10/1/5/pdf?version=1483521171","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/10/1/5/pdf?version=1483521171","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005927883","display_name":"Sung Eun Bae","orcid":"https://orcid.org/0000-0001-7670-8214"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sung Bae","raw_affiliation_strings":["Algorithm Research Institute, Christchurch 8053, New Zealand"],"affiliations":[{"raw_affiliation_string":"Algorithm Research Institute, Christchurch 8053, New Zealand","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050216576","display_name":"Tong-Wook Shinn","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tong-Wook Shinn","raw_affiliation_strings":["Algorithm Research Institute, Christchurch 8053, New Zealand"],"affiliations":[{"raw_affiliation_string":"Algorithm Research Institute, Christchurch 8053, New Zealand","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109861849","display_name":"Tadao Takaoka","orcid":null},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Tadao Takaoka","raw_affiliation_strings":["Algorithm Research Institute, Christchurch 8053, New Zealand","Computer Science and Software Engineering, University of Canterbury, Christchurch 8140, New Zealand"],"affiliations":[{"raw_affiliation_string":"Algorithm Research Institute, Christchurch 8053, New Zealand","institution_ids":[]},{"raw_affiliation_string":"Computer Science and Software Engineering, University of Canterbury, Christchurch 8140, New Zealand","institution_ids":["https://openalex.org/I185492890"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050216576"],"corresponding_institution_ids":[],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00952381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"1","first_page":"5","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.670058012008667},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6441042423248291},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6397017240524292},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5529263615608215},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5502113699913025},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.4987473487854004},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4590626358985901},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.45047885179519653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4067075550556183},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3535890579223633},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.11999037861824036}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.670058012008667},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6441042423248291},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6397017240524292},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5529263615608215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5502113699913025},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.4987473487854004},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4590626358985901},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.45047885179519653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4067075550556183},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3535890579223633},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.11999037861824036},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a10010005","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a10010005","pdf_url":"https://www.mdpi.com/1999-4893/10/1/5/pdf?version=1483521171","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:5b864c7e10cb4bac8378a30aa96da047","is_oa":true,"landing_page_url":"https://doaj.org/article/5b864c7e10cb4bac8378a30aa96da047","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 10, Iss 1, p 5 (2017)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/10/1/5/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a10010005","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 10; Issue 1; Pages: 5","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a10010005","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a10010005","pdf_url":"https://www.mdpi.com/1999-4893/10/1/5/pdf?version=1483521171","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310502","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2570190023.pdf","grobid_xml":"https://content.openalex.org/works/W2570190023.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1485293642","https://openalex.org/W1492464344","https://openalex.org/W1965662337","https://openalex.org/W1967688945","https://openalex.org/W2008252807","https://openalex.org/W2009419163","https://openalex.org/W2101506819","https://openalex.org/W2144540751","https://openalex.org/W2146103868","https://openalex.org/W2258796943","https://openalex.org/W2286558838","https://openalex.org/W2331042062","https://openalex.org/W2987907651"],"related_works":["https://openalex.org/W2404647514","https://openalex.org/W1667647204","https://openalex.org/W4247536566","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W1508895727","https://openalex.org/W2725786787","https://openalex.org/W4283160672","https://openalex.org/W55831818"],"abstract_inverted_index":{"We":[0,26,114,155],"present":[1],"efficient":[2],"sequential":[3],"and":[4,37,170],"parallel":[5,98,164],"algorithms":[6,99],"for":[7,159],"the":[8,17,23,32,38,45,54,60,80,90,116,130,135,160,183,195,199],"maximum":[9,33,39,200],"sum":[10,18,41,61],"(MS)":[11],"problem,":[12,47,92,132],"which":[13,126],"is":[14,67,84,127],"to":[15,68,124,193],"maximize":[16],"of":[19,87,112,139,153,162,176,198],"some":[20,173],"shape":[21,72,77,197],"in":[22,62],"data":[24,56],"array.":[25],"deal":[27],"with":[28],"two":[29],"MS":[30],"problems;":[31],"subarray":[34],"(MSA)":[35],"problem":[36,66],"convex":[40,71,201],"(MCS)":[42],"problem.":[43],"In":[44],"MSA":[46,91],"we":[48,133,189],"find":[49,69],"a":[50,70,75,85],"rectangular":[51,76],"part":[52],"within":[53],"given":[55],"array":[57,111,152],"that":[58,78,179],"maximizes":[59,79],"it.":[63],"The":[64],"MCS":[65,83,131],"rather":[73],"than":[74],"sum.":[81,202],"Thus,":[82],"generalization":[86],"MSA.":[88],"For":[89,129],"O":[93,140],"(":[94,105,141,146],"n":[95,106,108,121,142,147,149],")":[96,109,143,150],"time":[97,137],"are":[100,180],"already":[101],"known":[102],"on":[103,144,167],"an":[104,145],",":[107,148],"2D":[110,151],"processors.":[113,154],"improve":[115],"communication":[117],"steps":[118],"from":[119,182],"2":[120],"\u2212":[122],"1":[123],"n,":[125],"optimal.":[128],"achieve":[134],"asymptotic":[136],"bound":[138],"provide":[156,172],"rigorous":[157],"proofs":[158],"correctness":[161],"our":[163,177],"algorithm":[165,178],"based":[166],"Hoare":[168],"logic":[169],"also":[171],"experimental":[174],"results":[175],"gathered":[181],"Blue":[184],"Gene/P":[185],"super":[186],"computer.":[187],"Furthermore,":[188],"briefly":[190],"describe":[191],"how":[192],"compute":[194],"actual":[196]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2017-01-13T00:00:00"}