{"id":"https://openalex.org/W2005908084","doi":"https://doi.org/10.1145/322186.322187","title":"New Algorithms for Bin Packing","display_name":"New Algorithms for Bin Packing","publication_year":1980,"publication_date":"1980-04-01","ids":{"openalex":"https://openalex.org/W2005908084","doi":"https://doi.org/10.1145/322186.322187","mag":"2005908084"},"language":"en","primary_location":{"id":"doi:10.1145/322186.322187","doi":"https://doi.org/10.1145/322186.322187","is_oa":true,"landing_page_url":"https://doi.org/10.1145/322186.322187","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/322186.322187","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2005908084"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/322186.322187","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076560802","display_name":"Andrew Chi-Chih Yao","orcid":"https://orcid.org/0000-0002-3648-5594","observed_orcids":["https://orcid.org/0000-0002-3648-5594"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew Chi-Chih Yao","raw_affiliation_strings":["Computer Science Department, Stanford University, Stanford, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076560802"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":14.0728,"has_fulltext":true,"cited_by_count":331,"citation_normalized_percentile":{"value":0.98526483,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"27","issue":"2","first_page":"207","last_page":"227"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9965999722480774,"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.9965999722480774,"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.0019000000320374966,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.0005000000237487257,"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/bin-packing-problem","display_name":"bin packing","score":0.9580000042915344},{"id":"https://openalex.org/keywords/online-algorithms","display_name":"online algorithms","score":0.6449999809265137},{"id":"https://openalex.org/keywords/offline-algorithms","display_name":"offline algorithms","score":0.6769999861717224},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.6579999923706055},{"id":"https://openalex.org/keywords/first-fit","display_name":"first fit","score":0.6629999876022339},{"id":"https://openalex.org/keywords/first-fit-decreasing","display_name":"First Fit Decreasing","score":0.9980000257492065},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7760000228881836}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7956067323684692},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7029083967208862},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6615734100341797},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.610177218914032},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6027034521102905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5880324840545654},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5133765935897827},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47305312752723694},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.425296813249588},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4236100912094116},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32739585638046265},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05522644519805908}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/322186.322187","doi":"https://doi.org/10.1145/322186.322187","is_oa":true,"landing_page_url":"https://doi.org/10.1145/322186.322187","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/322186.322187","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"mag:2418222029","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=892175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1145/322186.322187","doi":"https://doi.org/10.1145/322186.322187","is_oa":true,"landing_page_url":"https://doi.org/10.1145/322186.322187","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/322186.322187","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G6146296403","display_name":null,"funder_award_id":"MCS-77","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2005908084.pdf","grobid_xml":"https://content.openalex.org/works/W2005908084.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W2022179164","https://openalex.org/W2025787252","https://openalex.org/W2025904765","https://openalex.org/W2043862089","https://openalex.org/W2048905935","https://openalex.org/W2143987816","https://openalex.org/W2401610261","https://openalex.org/W2956015669","https://openalex.org/W3027900649","https://openalex.org/W3198160809"],"related_works":["https://openalex.org/W7097132704","https://openalex.org/W7095164920","https://openalex.org/W2037615447","https://openalex.org/W2004690405","https://openalex.org/W2043049421","https://openalex.org/W2048628062","https://openalex.org/W2062634856","https://openalex.org/W2175514457","https://openalex.org/W1993191967","https://openalex.org/W1972566466"],"abstract_inverted_index":{"In":[0],"the":[1,28,48,59,108,120,167],"bin-packing":[2],"problem":[3],"a":[4],"list":[5],"L":[6,33,35,39,45,56],"of":[7,50],"n":[8,67,69,153,155,176,178],"numbers":[9],"are":[10,97,100],"to":[11],"be":[12,27],"packed":[13],"into":[14],"unit-capacity":[15],"bins.":[16],"For":[17],"any":[18,133,173],"algorithm":[19,71,82,135,157,180],"S":[20,25,31,43,54,136,141,181,186],",":[21,41],"let":[22],"r":[23,74,85,115,124,139,184],"(":[24,32,44,66,140,152,175,185],")":[26,46,142,187],"maximum":[29],"ratio":[30],")/":[34],"*":[36,40,57],"for":[37,91],"large":[38],"where":[42],"denotes":[47,58],"number":[49,61],"bins":[51],"used":[52],"by":[53],"and":[55,78,119],"minimum":[60],"needed.":[62],"An":[63],"on-line":[64,113,134],"\u039f":[65],"log":[68,154,177],")-time":[70,156,179],"RFF":[72],"with":[73,84,114,123],"(RFF)":[75],"=":[76,117,126],"5/3":[77],"an":[79,150],"off-line":[80],"polynomial-time":[81],"RFFD":[83],"(RFFD)":[86],"\u2264":[87],"11/9":[88],"-":[89],"\u03b5":[90,94],"some":[92],"fixed":[93],">":[95],"0,":[96],"given.":[98],"These":[99],"strictly":[101],"better,":[102],"respectively,":[103],"than":[104],"two":[105],"prominent":[106],"algorithms:":[107],"First-Fit":[109],"(FF),":[110],"which":[111],"is":[112,130,159,163],"(FF)":[116],"17/10,":[118],"First-Fit-Decreasing":[121],"(FFD)":[122,125],"11/9.":[127],"Furthermore,":[128],"it":[129],"shown":[131,164],"that":[132,165],"must":[137,182],"have":[138,183],"\u2265":[143,188],"3/2.":[144],"The":[145],"question,":[146],"\u201cHow":[147],"well":[148],"can":[149],"\u03bf":[151,174],"perform?\u201d":[158],"also":[160],"discussed.":[161],"It":[162],"in":[166],"generalized":[168],"d":[169,189],"-dimensional":[170],"bin":[171],"packing,":[172],".":[190]},"counts_by_year":[{"year":2026,"cited_by_count":9},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":21},{"year":2012,"cited_by_count":9}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-10T00:00:00"}
