{"id":"https://openalex.org/W2018816426","doi":"https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<69::aid-rsa4>3.0.co;2-v","title":"Bin packing with discrete item sizes, part II: Tight bounds on First Fit","display_name":"Bin packing with discrete item sizes, part II: Tight bounds on First Fit","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2018816426","doi":"https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<69::aid-rsa4>3.0.co;2-v","mag":"2018816426"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1098-2418(199701/03)10:1/2<69::aid-rsa4>3.0.co;2-v","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<69::aid-rsa4>3.0.co;2-v","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","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":[],"countries":[],"is_corresponding":true,"raw_author_name":"E. G. Coffman","raw_affiliation_strings":["Bell Laboratories, Lucent Technologies, Murray Hill, NJ\u200907974"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Lucent Technologies, Murray Hill, NJ\u200907974","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110866131","display_name":"David S. Johnson","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. S. Johnson","raw_affiliation_strings":["AT & T Labs, Murray Hill, NJ 07974"],"affiliations":[{"raw_affiliation_string":"AT & T Labs, Murray Hill, NJ 07974","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020744800","display_name":"Peter W. Shor","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. W. Shor","raw_affiliation_strings":["AT & T Labs, Murray Hill, NJ 07974"],"affiliations":[{"raw_affiliation_string":"AT & T Labs, Murray Hill, NJ 07974","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039736669","display_name":"Richard Weber","orcid":"https://orcid.org/0000-0002-2336-5534"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"R. R. Weber","raw_affiliation_strings":["Cambridge University; Cambridge United Kingdom"],"affiliations":[{"raw_affiliation_string":"Cambridge University; Cambridge United Kingdom","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5110463438"],"corresponding_institution_ids":[],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":4.6961,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.94025045,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"10","issue":"1-2","first_page":"69","last_page":"101"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9983999729156494,"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.9983999729156494,"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.9933000206947327,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9921000003814697,"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/mathematics","display_name":"Mathematics","score":0.7349631786346436},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7031899094581604},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.6104870438575745},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6040365099906921},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5377562046051025},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.4993267059326172},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4464676082134247},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43123960494995117},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4284246563911438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3171434700489044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12533733248710632},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1089223325252533}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7349631786346436},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7031899094581604},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.6104870438575745},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6040365099906921},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5377562046051025},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.4993267059326172},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4464676082134247},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43123960494995117},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4284246563911438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3171434700489044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12533733248710632},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1089223325252533},{"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},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/(sici)1098-2418(199701/03)10:1/2<69::aid-rsa4>3.0.co;2-v","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<69::aid-rsa4>3.0.co;2-v","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.7133","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.7133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~dsj/papers/BP2.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W173368591","https://openalex.org/W2034272113","https://openalex.org/W2138242427","https://openalex.org/W4288260564","https://openalex.org/W4255148175","https://openalex.org/W2971368033","https://openalex.org/W2001915926","https://openalex.org/W2096053066"],"abstract_inverted_index":{"In":[0],"the":[1,23,27,38,48,58,62,78,82,93,113,117,123,129],"bin":[2,60],"packing":[3,119],"problem,":[4,45],"a":[5,16,145,165,186],"list":[6],"L":[7],"of":[8,18,25,29,37,61,75,120],"n":[9,184,190],"items":[10],"is":[11,35,55,175,179],"to":[12,181],"be":[13],"packed":[14,56],"into":[15,57],"sequence":[17,63],"unit":[19],"capacity":[20],"bins":[21,30],"with":[22,183],"goal":[24],"minimizing":[26],"number":[28],"used.":[31],"First":[32],"Fit":[33],"(FF)":[34],"one":[36],"most":[39],"natural":[40],"on-line":[41],"algorithms":[42],"for":[43,68,103,158],"this":[44,173],"based":[46],"on":[47],"simple":[49],"rule":[50],"that":[51,64,134,151,172],"each":[52],"successive":[53],"item":[54,83],"first":[59],"currently":[65],"has":[66],"room":[67],"it.":[69],"We":[70,132],"present":[71],"an":[72],"average-case":[73],"analysis":[74],"FF":[76,110,118,136,153,197],"in":[77,116,128,193],"discrete":[79],"uniform":[80],"model:":[81],"sizes":[84],"are":[85],"drawn":[86],"independently":[87],"and":[88],"uniformly":[89],"at":[90,185],"random":[91],"from":[92],"set":[94],"f1=k;":[95],":":[96,97,98],";":[99],"(k":[100],"\\\\Gamma":[101],"1)=kg,":[102],"some":[104],"k":[105,161,178],"?":[106,148],"1.":[107],"Let":[108],"W":[109],"(L)":[111],"denote":[112],"wasted":[114],"space":[115,125],"L,":[121],"i.e.,":[122,142],"total":[124],"still":[126],"available":[127],"occupied":[130],"bins.":[131],"prove":[133,171],"E[W":[135,152,196],"(L)]":[137,154,198],"=":[138],"O(":[139],"p":[140,156],"nk),":[141],"there":[143],"exists":[144],"constant":[146],"c":[147,155],"0":[149],"such":[150],"nk":[157],"all":[159],"n;":[160],"sufficiently":[162],"large.":[163],"By":[164],"complementary":[166],"lower":[167],"bound":[168],"argument,":[169],"we":[170],"result":[174],"sharp,":[176],"unless":[177],"allowed":[180],"grow":[182],"rate":[187],"faster":[188],"than":[189],"1=3":[191],",":[192],"which":[194],"case":[195],"=...":[199]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}