{"id":"https://openalex.org/W2080300586","doi":"https://doi.org/10.1137/s0895480100369948","title":"An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing","display_name":"An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2080300586","doi":"https://doi.org/10.1137/s0895480100369948","mag":"2080300586"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480100369948","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480100369948","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5034376192","display_name":"Steven S. Seiden","orcid":"https://orcid.org/0009-0006-4358-946X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Steven S. Seiden","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5034376192"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4819,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.91725655,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"4","first_page":"458","last_page":"470"},"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/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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.811418890953064},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7440917491912842},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.7388672828674316},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7280426621437073},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6414449214935303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6307015419006348},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5522204041481018},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5461763143539429},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5415414571762085},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.5261703729629517},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5179673433303833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5054140090942383},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.45541951060295105},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4428042769432068},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34570086002349854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2148047685623169},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10048374533653259}],"concepts":[{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.811418890953064},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7440917491912842},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7388672828674316},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7280426621437073},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6414449214935303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6307015419006348},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5522204041481018},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5461763143539429},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5415414571762085},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5261703729629517},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5179673433303833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5054140090942383},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.45541951060295105},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4428042769432068},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34570086002349854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2148047685623169},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10048374533653259},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0895480100369948","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480100369948","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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":14,"referenced_works":["https://openalex.org/W103094345","https://openalex.org/W1987566992","https://openalex.org/W1997983719","https://openalex.org/W2005908084","https://openalex.org/W2006671706","https://openalex.org/W2016393589","https://openalex.org/W2019755210","https://openalex.org/W2037728500","https://openalex.org/W2043862089","https://openalex.org/W2048628062","https://openalex.org/W2048905935","https://openalex.org/W2055872862","https://openalex.org/W2056716554","https://openalex.org/W2103737482"],"related_works":["https://openalex.org/W3140031559","https://openalex.org/W1665347162","https://openalex.org/W2279442010","https://openalex.org/W2080300586","https://openalex.org/W1004341668","https://openalex.org/W4287640965","https://openalex.org/W2368197836","https://openalex.org/W2672198376","https://openalex.org/W2361015962","https://openalex.org/W2171709162"],"abstract_inverted_index":{"An":[0,92],"online":[1],"algorithm":[2,11,24,83,106],"for":[3,38,71],"variable-sized":[4],"bin":[5,42,75],"packing,":[6],"based":[7],"on":[8],"the":[9,56,65,82,96,114,156],"Harmonic":[10],"of":[12,41,63,74,95,130],"Lee":[13],"and":[14,133],"Lee,[J.":[15],"ACM,":[16],"32":[17],"(1985),":[18],"pp.":[19,33],"562--572],":[20],"is":[21,53,79,84,98,102,118,139,145],"investigated.":[22],"This":[23],"was":[25],"proposed":[26],"by":[27],"Csirik,":[28],"[Acta":[29],"Inform.,":[30],"26":[31],"(1989),":[32],"697--709],":[34],"who":[35],"proved":[36],"that":[37,58,81,104,123,147],"all":[39],"sets":[40],"sizes,":[43],"1.69103":[44],"upper":[45,51],"bounds":[46],"its":[47],"performance":[48,66,109,158],"ratio.":[49],"The":[50,126],"bound":[52],"improved":[54],"in":[55,141,161],"sense":[57],"we":[59],"give":[60],"a":[61,108],"method":[62],"calculating":[64],"ratio":[67,110,159],"to":[68,113,153],"any":[69,72],"accuracy":[70],"set":[73],"sizes.":[76],"Further,":[77],"it":[78,101,117],"shown":[80,103,146],"optimal":[85,157],"among":[86,148],"those":[87],"which":[88,150],"use":[89],"bounded":[90],"space.":[91],"interesting":[93],"feature":[94],"analysis":[97],"that,":[99],"although":[100],"our":[105],"achieves":[107],"arbitrarily":[111],"close":[112],"optimum":[115],"value,":[116],"not":[119],"known":[120],"precisely":[121],"what":[122],"value":[124],"is.":[125],"case":[127],"where":[128],"bins":[129],"capacity":[131],"1":[132],"$\\alpha":[134],"\\in":[135],"(0,1)$":[136],"are":[137,151],"used":[138],"studied":[140],"greater":[142],"detail.":[143],"It":[144],"algorithms":[149],"allowed":[152],"choose":[154],"$\\alpha$,":[155],"lies":[160],"[1.37530,1.37532].":[162]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}