{"id":"https://openalex.org/W2125990029","doi":"https://doi.org/10.1007/s00224-014-9550-z","title":"Hardness of Approximation for Knapsack Problems","display_name":"Hardness of Approximation for Knapsack Problems","publication_year":2014,"publication_date":"2014-06-15","ids":{"openalex":"https://openalex.org/W2125990029","doi":"https://doi.org/10.1007/s00224-014-9550-z","mag":"2125990029"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-014-9550-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-014-9550-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-014-9550-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-014-9550-z.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083983355","display_name":"Harry Buhrman","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]},{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Harry Buhrman","raw_affiliation_strings":["CWI, Amsterdam, Netherlands","ILLC, University of Amsterdam, Amsterdam, the Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"ILLC, University of Amsterdam, Amsterdam, the Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016368091","display_name":"Bruno Loff","orcid":"https://orcid.org/0000-0001-7562-457X"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bruno Loff","raw_affiliation_strings":["CWI, Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004254084","display_name":"Leen Torenvliet","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Leen Torenvliet","raw_affiliation_strings":["ILLC, University of Amsterdam, Amsterdam, the Netherlands"],"affiliations":[{"raw_affiliation_string":"ILLC, University of Amsterdam, Amsterdam, the Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083983355"],"corresponding_institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I887064364"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.15242776,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"56","issue":"2","first_page":"372","last_page":"393"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9976000189781189,"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/knapsack-problem","display_name":"Knapsack problem","score":0.9921867251396179},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.847925066947937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6674540042877197},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6257696151733398},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.625639796257019},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.518277108669281},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.475053071975708},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47405263781547546},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.4500633776187897},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3711557686328888},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26291948556900024},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06438347697257996}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9921867251396179},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.847925066947937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6674540042877197},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6257696151733398},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.625639796257019},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.518277108669281},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.475053071975708},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47405263781547546},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.4500633776187897},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3711557686328888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26291948556900024},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06438347697257996},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00224-014-9550-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-014-9550-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-014-9550-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/42db8062-d0ce-4857-80e7-4bcd6bde83df","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/hardness-of-approximation-for-knapsack-problems(42db8062-d0ce-4857-80e7-4bcd6bde83df).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Buhrman, H, Loff, B & Torenvliet, L 2015, 'Hardness of approximation for Knapsack problems', Theory of Computing Systems, vol. 56, no. 2, pp. 372-393. https://doi.org/10.1007/s00224-014-9550-z","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:openaire/42db8062-d0ce-4857-80e7-4bcd6bde83df","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/hardness-of-approximation-for-knapsack-problems(42db8062-d0ce-4857-80e7-4bcd6bde83df).html","pdf_url":"https://pure.uva.nl/ws/files/1887095/156267_10.1007_s00224_014_9550_z.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Buhrman, H, Loff, B & Torenvliet, L 2015, 'Hardness of approximation for Knapsack problems', Theory of Computing Systems, vol. 56, no. 2, pp. 372-393. https://doi.org/10.1007/s00224-014-9550-z","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:cwi:oai:cwi.nl:22925","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/22925","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory of Computing Systems","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:cwi:oai:cwi.nl:24129","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/24129","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory of Computing Systems, 56(2), 372 - 393","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dare.uva.nl:publications/42db8062-d0ce-4857-80e7-4bcd6bde83df","is_oa":false,"landing_page_url":"http://dare.uva.nl/personal/pure/en/publications/hardness-of-approximation-for-knapsack-problems(42db8062-d0ce-4857-80e7-4bcd6bde83df).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1007/s00224-014-9550-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-014-9550-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-014-9550-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2125990029.pdf","grobid_xml":"https://content.openalex.org/works/W2125990029.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W157369951","https://openalex.org/W1507575253","https://openalex.org/W1507717186","https://openalex.org/W1576805635","https://openalex.org/W1995725694","https://openalex.org/W1998084650","https://openalex.org/W1999032440","https://openalex.org/W2003159902","https://openalex.org/W2011047736","https://openalex.org/W2014071862","https://openalex.org/W2018637736","https://openalex.org/W2038247515","https://openalex.org/W2045492613","https://openalex.org/W2048068744","https://openalex.org/W2068638452","https://openalex.org/W2075145215","https://openalex.org/W2104952158","https://openalex.org/W2109797885","https://openalex.org/W2139087151","https://openalex.org/W2588149216","https://openalex.org/W2611804663","https://openalex.org/W4240781210","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W3169691842","https://openalex.org/W2122137596","https://openalex.org/W2381035939","https://openalex.org/W3166857172","https://openalex.org/W2412614002","https://openalex.org/W2024427769","https://openalex.org/W2168163332","https://openalex.org/W4288642040","https://openalex.org/W2087209118"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}