{"id":"https://openalex.org/W2028545499","doi":"https://doi.org/10.1137/050647049","title":"Lower Bound for the Online Bin Packing Problem with Restricted Repacking","display_name":"Lower Bound for the Online Bin Packing Problem with Restricted Repacking","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2028545499","doi":"https://doi.org/10.1137/050647049","mag":"2028545499"},"language":"en","primary_location":{"id":"doi:10.1137/050647049","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050647049","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5059910732","display_name":"J\u00e1nos Balogh","orcid":"https://orcid.org/0000-0002-4611-616X"},"institutions":[{"id":"https://openalex.org/I227486990","display_name":"University of Szeged","ror":"https://ror.org/01pnej532","country_code":"HU","type":"education","lineage":["https://openalex.org/I227486990"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"J\u00e1nos Balogh","raw_affiliation_strings":["balogh@jgypk.u-szeged.hu and bekesi@jgypk.u-szeged.hu and galambos@jgypk.u-szeged.hu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"balogh@jgypk.u-szeged.hu and bekesi@jgypk.u-szeged.hu and galambos@jgypk.u-szeged.hu#TAB#","institution_ids":["https://openalex.org/I227486990"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068357961","display_name":"J\u00f3zsef B\u00e9k\u00e9si","orcid":"https://orcid.org/0000-0003-3820-9777"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J\u00f3zsef B\u00e9k\u00e9si","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110525746","display_name":"G\u00e1bor Galambos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G\u00e1bor Galambos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5000892313","display_name":"Gerhard Reinelt","orcid":"https://orcid.org/0000-0002-7193-501X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gerhard Reinelt","raw_affiliation_strings":["Gerhard.Reinelt@informatik.uni-heidelberg.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Gerhard.Reinelt@informatik.uni-heidelberg.de#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6391,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.84592029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"38","issue":"1","first_page":"398","last_page":"410"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":1.0,"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":1.0,"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.9961000084877014,"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.9959999918937683,"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/bin-packing-problem","display_name":"Bin packing problem","score":0.9192081689834595},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.8013633489608765},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.641528308391571},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.545927882194519},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5409186482429504},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5049405694007874},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48984476923942566},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.48257961869239807},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.45457643270492554},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3109748959541321},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28877079486846924},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.08275368809700012},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05412560701370239}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9192081689834595},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.8013633489608765},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.641528308391571},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.545927882194519},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5409186482429504},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5049405694007874},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48984476923942566},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.48257961869239807},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.45457643270492554},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3109748959541321},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28877079486846924},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.08275368809700012},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05412560701370239},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/050647049","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050647049","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W839515883","https://openalex.org/W1549010977","https://openalex.org/W1553750894","https://openalex.org/W1825427184","https://openalex.org/W1963608587","https://openalex.org/W1975216035","https://openalex.org/W1984448842","https://openalex.org/W1987566992","https://openalex.org/W2032955874","https://openalex.org/W2072676072","https://openalex.org/W2078659331","https://openalex.org/W2088072844","https://openalex.org/W2123068254","https://openalex.org/W2145028977","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W76601469","https://openalex.org/W4235035380","https://openalex.org/W2971368033","https://openalex.org/W2026961896","https://openalex.org/W1590563747","https://openalex.org/W2056716554","https://openalex.org/W4288260564","https://openalex.org/W3167861864","https://openalex.org/W2963371694","https://openalex.org/W4255148175"],"abstract_inverted_index":{"In":[0,53],"1996":[1],"Ivkovi\u010d":[2],"and":[3,93],"Lloyd":[4],"[A":[5],"fundamental":[6],"restriction":[7],"on":[8,27],"fully":[9,34,80],"dynamic":[10,35,81],"maintenance":[11],"of":[12,42,71],"bin":[13,36,74,82],"packing,":[14,75],"Inform.":[15],"Process.":[16],"Lett.,":[17],"59":[18],"(1996),":[19],"pp.":[20],"229\u2013232]":[21],"gave":[22],"the":[23,28,40,72,88,106],"lower":[24,89],"bound":[25,90,100],"$\\frac{4}{3}$":[26],"asymptotic":[29],"worst-case":[30],"ratio":[31],"for":[32,67,79],"so-called":[33],"packing":[37,83],"algorithms,":[38],"where":[39],"number":[41],"repackable":[43],"items":[44],"in":[45],"each":[46],"step":[47],"is":[48],"restricted":[49],"by":[50,91],"a":[51,68,95],"constant.":[52],"this":[54,58],"paper":[55],"we":[56],"improve":[57],"result":[59],"to":[60],"about":[61],"$1.3871$.":[62],"We":[63,86],"present":[64],"our":[65],"proof":[66],"semionline":[69],"case":[70],"classical":[73],"but":[76],"it":[77],"works":[78],"as":[84],"well.":[85],"prove":[87],"analyzing":[92],"solving":[94],"specific":[96],"optimization":[97],"problem.":[98],"The":[99],"can":[101],"be":[102],"expressed":[103],"exactly":[104],"using":[105],"Lambert":[107],"W":[108],"function.":[109]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}