{"id":"https://openalex.org/W2237348435","doi":"https://doi.org/10.1007/s00224-015-9644-2","title":"An Improved Approximation Scheme for Variable-Sized Bin Packing","display_name":"An Improved Approximation Scheme for Variable-Sized Bin Packing","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2237348435","doi":"https://doi.org/10.1007/s00224-015-9644-2","mag":"2237348435"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-015-9644-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-015-9644-2","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Theory of Parallelism, Department of Computer Science, University of Kiel, 24098, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Theory of Parallelism, Department of Computer Science, University of Kiel, 24098, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058444516","display_name":"Stefan Erich Julius Kraft","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Kraft","raw_affiliation_strings":["Theory of Parallelism, Department of Computer Science, University of Kiel, 24098, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Theory of Parallelism, Department of Computer Science, University of Kiel, 24098, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071305115"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.13363275,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"59","issue":"2","first_page":"262","last_page":"322"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9970999956130981,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9868999719619751,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9574601054191589},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7346429824829102},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.6961033940315247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6687769889831543},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6169554591178894},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5292465090751648},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.5116487145423889},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4968293011188507},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.47266802191734314},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4650595784187317},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4286981523036957},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37195831537246704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1867339313030243},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11841017007827759}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9574601054191589},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7346429824829102},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.6961033940315247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6687769889831543},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6169554591178894},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5292465090751648},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.5116487145423889},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4968293011188507},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.47266802191734314},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4650595784187317},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4286981523036957},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37195831537246704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1867339313030243},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11841017007827759}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00224-015-9644-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-015-9644-2","pdf_url":null,"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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W158608945","https://openalex.org/W1513839537","https://openalex.org/W1564665474","https://openalex.org/W2006671706","https://openalex.org/W2011039300","https://openalex.org/W2024624524","https://openalex.org/W2026891055","https://openalex.org/W2032522336","https://openalex.org/W2032938251","https://openalex.org/W2050319410","https://openalex.org/W2050328660","https://openalex.org/W2052064586","https://openalex.org/W2060453713","https://openalex.org/W2067500652","https://openalex.org/W2068835684","https://openalex.org/W2080561834","https://openalex.org/W2085478109","https://openalex.org/W2102929776","https://openalex.org/W2113195911","https://openalex.org/W2123068254","https://openalex.org/W2134422938","https://openalex.org/W2144946856","https://openalex.org/W2145028977","https://openalex.org/W2244377482","https://openalex.org/W2341171179","https://openalex.org/W2641205488","https://openalex.org/W2964162348","https://openalex.org/W4236127247","https://openalex.org/W6631722374"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W3169691842","https://openalex.org/W3166857172","https://openalex.org/W1701984136","https://openalex.org/W2122137596","https://openalex.org/W2060645964","https://openalex.org/W1984121220","https://openalex.org/W1601835603","https://openalex.org/W1556368910"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}