{"id":"https://openalex.org/W3137214896","doi":"https://doi.org/10.1007/s10951-006-5594-5","title":"Approximation Algorithms for Extensible Bin Packing","display_name":"Approximation Algorithms for Extensible Bin Packing","publication_year":2006,"publication_date":"2006-01-09","ids":{"openalex":"https://openalex.org/W3137214896","doi":"https://doi.org/10.1007/s10951-006-5594-5","mag":"3137214896"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-006-5594-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-006-5594-5","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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":"Journal of Scheduling","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/A5110463438","display_name":"E. G. Coffman","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. G. Coffman","raw_affiliation_strings":["Electrical Engineering Department, Columbia University, New York, NY, 10027"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Columbia University, New York, NY, 10027","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079864020","display_name":"George S. Lueker","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"George S. Lueker","raw_affiliation_strings":["Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine, CA, 92697-3435"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine, CA, 92697-3435","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079864020"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.2787,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.91980467,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"9","issue":"1","first_page":"63","last_page":"69"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.919793426990509},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.744032621383667},{"id":"https://openalex.org/keywords/extensibility","display_name":"Extensibility","score":0.7422236204147339},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5271389484405518},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5189456939697266},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5162798762321472},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4796479344367981},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47200819849967957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46078646183013916},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4217609167098999},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3707551956176758},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3207598030567169}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.919793426990509},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.744032621383667},{"id":"https://openalex.org/C32833848","wikidata":"https://www.wikidata.org/wiki/Q4115054","display_name":"Extensibility","level":2,"score":0.7422236204147339},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5271389484405518},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5189456939697266},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5162798762321472},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4796479344367981},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47200819849967957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46078646183013916},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4217609167098999},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3707551956176758},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3207598030567169},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10951-006-5594-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-006-5594-5","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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":"Journal of Scheduling","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":10,"referenced_works":["https://openalex.org/W1977276352","https://openalex.org/W2011039300","https://openalex.org/W2012329067","https://openalex.org/W2032522336","https://openalex.org/W2039775944","https://openalex.org/W2065951914","https://openalex.org/W2079148437","https://openalex.org/W2093979815","https://openalex.org/W2100440346","https://openalex.org/W2123068254"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W4255148175","https://openalex.org/W2971368033","https://openalex.org/W2001915926","https://openalex.org/W2096053066","https://openalex.org/W2104955674","https://openalex.org/W2949755993","https://openalex.org/W2967935725","https://openalex.org/W1590563747"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}