{"id":"https://openalex.org/W2075530792","doi":"https://doi.org/10.1142/s0129053392000043","title":"A PARALLEL ALGORITHM FOR THE KNAPSACK PROBLEM WITH MEMORY/PROCESSOR TRADEOFF M<sup>2</sup>P = O(2<sup>n/2</sup>)","display_name":"A PARALLEL ALGORITHM FOR THE KNAPSACK PROBLEM WITH MEMORY/PROCESSOR TRADEOFF M<sup>2</sup>P = O(2<sup>n/2</sup>)","publication_year":1992,"publication_date":"1992-06-01","ids":{"openalex":"https://openalex.org/W2075530792","doi":"https://doi.org/10.1142/s0129053392000043","mag":"2075530792"},"language":"en","primary_location":{"id":"doi:10.1142/s0129053392000043","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129053392000043","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111661024","display_name":"Henry Ker\u2013Chang Chang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"HENRY KER-CHANG CHANG","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5083540751","display_name":"Jonathan Jen-Rong Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"JONATHAN JEN-RONG CHEN","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.16808659,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"04","issue":"02","first_page":"109","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9907000064849854,"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"}},{"id":"https://openalex.org/T12707","display_name":"Vehicle License Plate Recognition","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/knapsack-problem","display_name":"Knapsack problem","score":0.885064423084259},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7118178606033325},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6788980960845947},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.602928102016449},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5118429064750671},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49015793204307556},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4598162770271301}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.885064423084259},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7118178606033325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6788980960845947},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.602928102016449},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5118429064750671},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49015793204307556},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4598162770271301}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129053392000043","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129053392000043","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2005493932","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W3169691842","https://openalex.org/W2089402478"],"abstract_inverted_index":{"The":[0,16,54,78],"purpose":[1],"of":[2,18,63,68,84],"this":[3],"paper":[4],"is":[5,23,80,97],"to":[6,87],"suggest":[7],"a":[8,26,32,40],"new":[9],"parallel":[10,21],"algorithm":[11,22,96],"for":[12],"the":[13,19,66,94,101],"knapsack":[14,43],"problem.":[15],"design":[17],"proposed":[20,55,95],"based":[24],"on":[25],"shared":[27],"memory":[28,76],"SIMD":[29],"machine":[30],"with":[31,48,82],"heap":[33],"tree":[34],"data":[35],"structure.":[36],"It":[37],"can":[38,57,71],"solve":[39],"general":[41],"n-component":[42],"problem":[44],"in":[45,61],"time":[46],"O(2n/2)":[47],"memory-processor":[49],"tradeoff":[50],"M2P":[51],"=":[52],"O(2n/2).":[53],"technique":[56],"have":[58],"better":[59],"performance":[60,79],"terms":[62],"cost":[64],"as":[65],"number":[67],"processors":[69],"needed":[70],"be":[72],"offset":[73],"by":[74],"increasing":[75],"space.":[77],"compared":[81],"those":[83],"other":[85],"algorithms":[86],"demonstrate":[88],"its":[89],"superiority.":[90],"We":[91],"believe":[92],"that":[93],"pragmatically":[98],"feasible":[99],"at":[100],"moment":[102],"when":[103],"multiprocessor":[104],"systems":[105],"are":[106],"gradually":[107],"becoming":[108],"popular.":[109]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}