{"id":"https://openalex.org/W2023489120","doi":"https://doi.org/10.1007/bf00292111","title":"Parallel approximation schemes for Subset Sum and Knapsack problems","display_name":"Parallel approximation schemes for Subset Sum and Knapsack problems","publication_year":1987,"publication_date":"1987-08-01","ids":{"openalex":"https://openalex.org/W2023489120","doi":"https://doi.org/10.1007/bf00292111","mag":"2023489120"},"language":"en","primary_location":{"id":"doi:10.1007/bf00292111","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00292111","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","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/A5068585777","display_name":"Joseph G. Peters","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Joseph G. Peters","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, British Columbia, Canada","School of Computing Science, Simon Fraser University, Burnaby, Canada, V5A 1S6"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, British Columbia, Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, Canada, V5A 1S6","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112072124","display_name":"Larry Rudolph","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Larry Rudolph","raw_affiliation_strings":["Department of Computer Science, Carnegie-Mellon University, 15213, Pittsburgh, PA, USA","Department of Computer Science, Carnegie Mellon University, Pittsburgh, USA 15213#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Carnegie-Mellon University, 15213, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Department of Computer Science, Carnegie Mellon University, Pittsburgh, USA 15213#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":4.7082,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.94127412,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"24","issue":"4","first_page":"417","last_page":"432"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.9646598100662231},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.8104357123374939},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.721085786819458},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.6256440877914429},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5651060938835144},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5323902368545532},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.5107579231262207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5024571418762207},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.476699560880661},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44396719336509705},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43952086567878723},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4294497072696686},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38627681136131287},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3586357831954956},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33351147174835205},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33036425709724426},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3220450282096863}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9646598100662231},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.8104357123374939},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.721085786819458},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.6256440877914429},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5651060938835144},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5323902368545532},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.5107579231262207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5024571418762207},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.476699560880661},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44396719336509705},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43952086567878723},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4294497072696686},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38627681136131287},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3586357831954956},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33351147174835205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33036425709724426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3220450282096863}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf00292111","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00292111","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W78507853","https://openalex.org/W1980563498","https://openalex.org/W1991540883","https://openalex.org/W1992734168","https://openalex.org/W2004618348","https://openalex.org/W2011039300","https://openalex.org/W2016601686","https://openalex.org/W2026891055","https://openalex.org/W2067297441","https://openalex.org/W2071054511","https://openalex.org/W2147799577","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1866060861","https://openalex.org/W2131552728","https://openalex.org/W2076845371","https://openalex.org/W1976040835","https://openalex.org/W2968986948","https://openalex.org/W2567804199","https://openalex.org/W2023489120","https://openalex.org/W2783992526","https://openalex.org/W2113195911","https://openalex.org/W2965064130"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}