{"id":"https://openalex.org/W2167596143","doi":"https://doi.org/10.1007/978-3-642-27660-6_26","title":"A Fast Approximation Scheme for the Multiple Knapsack Problem","display_name":"A Fast Approximation Scheme for the Multiple Knapsack Problem","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2167596143","doi":"https://doi.org/10.1007/978-3-642-27660-6_26","mag":"2167596143"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-27660-6_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-27660-6_26","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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":["Institut f\u00fcr Informatik, Christian-Albrechts-Universit\u00e4t zu Kiel, 24098, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Christian-Albrechts-Universit\u00e4t zu Kiel, 24098, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071305115"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.8549,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.9791294,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"313","last_page":"324"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"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.9997000098228455,"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.9975000023841858,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9897000193595886,"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.9276065826416016},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.8406151533126831},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.7362382411956787},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7242090702056885},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.6924502849578857},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6481223106384277},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6426401138305664},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6096855401992798},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6053721904754639},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.594047486782074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5895435214042664},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.4937501847743988},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4286072850227356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.196743905544281},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09742417931556702}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9276065826416016},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.8406151533126831},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7362382411956787},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7242090702056885},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.6924502849578857},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6481223106384277},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6426401138305664},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6096855401992798},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6053721904754639},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.594047486782074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5895435214042664},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.4937501847743988},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4286072850227356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.196743905544281},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09742417931556702}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-27660-6_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-27660-6_26","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:macau.uni-kiel.de:macau_mods_00001844","is_oa":false,"landing_page_url":"https://macau.uni-kiel.de/receive/macau_mods_00001844","pdf_url":null,"source":{"id":"https://openalex.org/S4377196482","display_name":"MACAU (Kiel University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I32021983","host_organization_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","host_organization_lineage":["https://openalex.org/I32021983"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doc-type:Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W272087405","https://openalex.org/W1492611605","https://openalex.org/W1506483053","https://openalex.org/W1518294541","https://openalex.org/W1544799188","https://openalex.org/W1556368910","https://openalex.org/W1878907771","https://openalex.org/W1942157993","https://openalex.org/W1972853793","https://openalex.org/W1975503278","https://openalex.org/W1980809300","https://openalex.org/W1981992833","https://openalex.org/W2000444555","https://openalex.org/W2008323735","https://openalex.org/W2013198217","https://openalex.org/W2019363670","https://openalex.org/W2026891055","https://openalex.org/W2032289187","https://openalex.org/W2050328660","https://openalex.org/W2060963575","https://openalex.org/W2066671865","https://openalex.org/W2085922444","https://openalex.org/W2089047615","https://openalex.org/W2102929776","https://openalex.org/W2110526045","https://openalex.org/W2113195911","https://openalex.org/W2123068254","https://openalex.org/W2145028977","https://openalex.org/W4236127247","https://openalex.org/W4248841288"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2908214350","https://openalex.org/W2799046353","https://openalex.org/W1984121220","https://openalex.org/W1556368910","https://openalex.org/W2900218461","https://openalex.org/W2222484777","https://openalex.org/W2159351466","https://openalex.org/W1601835603","https://openalex.org/W2122137596"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}