{"id":"https://openalex.org/W2588049873","doi":"https://doi.org/10.1109/allerton.2016.7852247","title":"A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing model","display_name":"A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing model","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2588049873","doi":"https://doi.org/10.1109/allerton.2016.7852247","mag":"2588049873"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2016.7852247","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2016.7852247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-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/A5018196632","display_name":"Alexander Stolyar","orcid":"https://orcid.org/0000-0002-1496-9803"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander L. Stolyar","raw_affiliation_strings":["Faculty of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101087537","display_name":"Yuan Zhong","orcid":null},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuan Zhong","raw_affiliation_strings":["Booth School of Business, University of Chicago, Chicago, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Booth School of Business, University of Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2954,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68519177,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"319","last_page":"326"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9969000220298767,"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/sublinear-function","display_name":"Sublinear function","score":0.8795349597930908},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.8205976486206055},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5449427962303162},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5211943984031677},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5132415294647217},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4926205277442932},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.43193936347961426},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.42488569021224976},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4133337736129761},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.41290947794914246},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40882062911987305},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.321159303188324}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8795349597930908},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.8205976486206055},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5449427962303162},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5211943984031677},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5132415294647217},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4926205277442932},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.43193936347961426},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.42488569021224976},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4133337736129761},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.41290947794914246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40882062911987305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.321159303188324},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2016.7852247","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2016.7852247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W90213227","https://openalex.org/W1579739398","https://openalex.org/W1595409123","https://openalex.org/W1629501955","https://openalex.org/W1959817402","https://openalex.org/W1967590952","https://openalex.org/W1975216035","https://openalex.org/W1980171347","https://openalex.org/W1992365301","https://openalex.org/W2022575296","https://openalex.org/W2028776589","https://openalex.org/W2039060503","https://openalex.org/W2039612281","https://openalex.org/W2042276676","https://openalex.org/W2075873608","https://openalex.org/W2078126958","https://openalex.org/W2081708767","https://openalex.org/W2117839333","https://openalex.org/W2144005446","https://openalex.org/W2164353254","https://openalex.org/W2235332950","https://openalex.org/W2296319761","https://openalex.org/W2899702797","https://openalex.org/W2913527856","https://openalex.org/W2963819536","https://openalex.org/W3101606912","https://openalex.org/W4249599116","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W2809723425","https://openalex.org/W2052708136","https://openalex.org/W2005302727","https://openalex.org/W3082028334","https://openalex.org/W1973725449","https://openalex.org/W1531571111","https://openalex.org/W1494759436"],"abstract_inverted_index":{"We":[0,52,174],"consider":[1,53,161],"an":[2,63,107,171],"infinite-server":[3],"system,":[4,101],"where":[5,90,126,165],"multiple":[6],"customers":[7,98,138],"can":[8],"be":[9],"placed":[10,23],"into":[11],"one":[12],"server":[13],"for":[14,24,177],"service":[15,25,34],"simultaneously,":[16],"subject":[17],"to":[18,41,73,183],"packing":[19],"constraints.":[20],"Customers":[21],"are":[22],"immediately":[26],"upon":[27],"arrival,":[28],"and":[29,102,142,149],"leave":[30],"the":[31,43,54,83,93,100,116,119,129,133,162,191,194,205,215],"system":[32,38,130,206],"after":[33],"completion.":[35],"A":[36],"key":[37],"objective":[39],"is":[40,62,70,92,106,111,128,170,186,197,210],"minimize":[42],"total":[44,95,135],"number":[45,96,136],"of":[46,82,97,137,219],"occupied":[47],"servers":[48],"in":[49,59,99,115,139,190,204],"steady":[50,140],"state.":[51],"GreedyRandom":[55],"(GRAND)":[56],"algorithm,":[57,68,164],"introduced":[58],"[23].":[60],"This":[61,209],"extremely":[64],"simple":[65],"customer":[66],"placement":[67],"which":[69],"also":[71],"easy":[72],"implement.":[74],"In":[75,157],"[23],":[76],"we":[77,160],"showed":[78],"that":[79,176,193],"a":[80,103,154,211],"version":[81],"GRAND":[84],"algorithm":[85,108,172],"-":[86,110],"so":[87],"called":[88],"GRAND(aZ),":[89],"Z":[91],"current":[94],">":[104,144],"0":[105,145,152],"parameter":[109],"weakly":[112],"asymptotically":[113,188,217],"optimal,":[114,189],"following":[117],"sense:":[118],"steady-state":[120],"optimality":[121,195,218],"gap":[122,196],"grows":[123],"as":[124,153,199],"c(a)r,":[125],"r":[127,200],"scale,":[131],"i.e.,":[132],"expected":[134],"state,":[141],"c(a)":[143,150],"depends":[146],"on":[147],"a,":[148],"\u2192":[151,155,201],"0.":[156],"this":[158],"paper,":[159],"GRAND(Zp)":[163,185],"p":[166,180],"\u2208":[167],"[0,":[168],"1)":[169],"parameter.":[173],"prove":[175],"any":[178],"fixed":[179],"sufficiently":[181],"close":[182],"1,":[184],"strongly":[187],"sense":[192],"o(r)":[198],"\u221e,":[202],"sublinear":[203],"scale":[207],"r.":[208],"stronger":[212],"result":[213],"than":[214],"weak":[216],"GRAND(aZ).":[220]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}