{"id":"https://openalex.org/W2981089183","doi":"https://doi.org/10.1145/3364214","title":"Tight Bounds for Clairvoyant Dynamic Bin Packing","display_name":"Tight Bounds for Clairvoyant Dynamic Bin Packing","publication_year":2019,"publication_date":"2019-09-30","ids":{"openalex":"https://openalex.org/W2981089183","doi":"https://doi.org/10.1145/3364214","mag":"2981089183"},"language":"en","primary_location":{"id":"doi:10.1145/3364214","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3364214","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"ACM Transactions on Parallel 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/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yossi Azar","raw_affiliation_strings":["Tel-Aviv University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel-Aviv University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048310514","display_name":"Danny Vainstein","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Danny Vainstein","raw_affiliation_strings":["Tel-Aviv University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel-Aviv University","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082061504"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":1.9883,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.8888528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"6","issue":"3","first_page":"1","last_page":"21"},"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.9998999834060669,"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.9970999956130981,"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/competitive-analysis","display_name":"Competitive analysis","score":0.8827801942825317},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.8183271288871765},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7446128129959106},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7133128643035889},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.6478919982910156},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.6267102360725403},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5811015963554382},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5796002745628357},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5305837988853455},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5264473557472229},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.464288592338562},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4170428514480591},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3887327015399933},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3307168483734131},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32167744636535645},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11833414435386658},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07694175839424133}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8827801942825317},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8183271288871765},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7446128129959106},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7133128643035889},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.6478919982910156},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.6267102360725403},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5811015963554382},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5796002745628357},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5305837988853455},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5264473557472229},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.464288592338562},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4170428514480591},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3887327015399933},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3307168483734131},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32167744636535645},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11833414435386658},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07694175839424133},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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":1,"locations":[{"id":"doi:10.1145/3364214","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3364214","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7247089935","display_name":null,"funder_award_id":"1506/16","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W20175","https://openalex.org/W1975216035","https://openalex.org/W1987566992","https://openalex.org/W1999039393","https://openalex.org/W2043862089","https://openalex.org/W2048348088","https://openalex.org/W2078659331","https://openalex.org/W2098705232","https://openalex.org/W2131641675","https://openalex.org/W2176549387","https://openalex.org/W2181516744","https://openalex.org/W2469847610","https://openalex.org/W2505550437"],"related_works":["https://openalex.org/W2042512761","https://openalex.org/W2094708479","https://openalex.org/W2070091108","https://openalex.org/W1830700568","https://openalex.org/W3022071589","https://openalex.org/W2481908560","https://openalex.org/W2114780236","https://openalex.org/W2794570164","https://openalex.org/W2567853751","https://openalex.org/W4240895316"],"abstract_inverted_index":{"In":[0],"this":[1,149,172],"article,":[2],"we":[3,156,194],"focus":[4,50,153],"on":[5,52,89,134,154],"the":[6,15,30,53,61,72,90,98,101,111,135,144,158,175,179,188],"Clairvoyant":[7],"Dynamic":[8],"Bin":[9,18],"Packing":[10,19],"(DBP)":[11],"problem,":[12],"which":[13,57],"extends":[14],"Classical":[16],"Online":[17],"problem":[20,42],"in":[21],"that":[22,68,193],"items":[23],"arrive":[24],"and":[25,29,103,163],"depart":[26],"over":[27],"time":[28,32,64],"departure":[31],"of":[33,65,106,129,138,160,178,190,202],"an":[34,183],"item":[35],"is":[36,95,196],"known":[37],"upon":[38],"its":[39],"arrival.":[40],"The":[41],"naturally":[43],"arises":[44],"when":[45],"handling":[46],"cloud-based":[47],"networks.":[48],"We":[49,109,122,151],"specifically":[51],"MinUsageTime":[54],"objective":[55],"function,":[56],"aims":[58],"to":[59,148,199],"minimize":[60],"overall":[62],"usage":[63],"all":[66,107],"bins":[67],"are":[69],"opened":[70],"during":[71],"packing":[73],"process.":[74],"Earlier":[75],"work":[76],"has":[77],"shown":[78],"a":[79,116,125,165],"O":[80,117,166],"(log":[81,167],"&amp;mu":[82],"/":[83],"log":[84,85,119,132,168],"\u03bc)":[86,133],"upper":[87,112],"bound":[88,113,128,177],"algorithm\u2019s":[91],"competitiveness,":[92],"where":[93],"\u03bc":[94],"defined":[96],"as":[97],"ratio":[99,137],"between":[100],"maximal":[102],"minimal":[104],"durations":[105],"items.":[108],"improve":[110],"by":[114,182],"giving":[115],"(\u221a":[118,131],"\u03bc)-competitive":[120,169],"algorithm.":[121],"then":[123,152],"provide":[124],"matching":[126],"lower":[127,176],"\u03a9":[130],"competitive":[136],"any":[139],"online":[140],"algorithm,":[141],"thus":[142],"closing":[143],"gap":[145],"with":[146],"regard":[147],"problem.":[150],"what":[155],"call":[157],"class":[159],"aligned":[161],"inputs":[162],"give":[164],"algorithm":[170,192],"for":[171],"case,":[173],"beating":[174],"general":[180],"case":[181],"exponential":[184],"factor.":[185],"Surprisingly":[186],"enough,":[187],"analysis":[189],"our":[191],"present":[195],"closely":[197],"related":[198],"various":[200],"properties":[201],"binary":[203],"strings.":[204]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
