{"id":"https://openalex.org/W2735399061","doi":"https://doi.org/10.1145/3568677","title":"Competitive Algorithms for Generalized <i>k</i> -Server in Uniform Metrics","display_name":"Competitive Algorithms for Generalized <i>k</i> -Server in Uniform Metrics","publication_year":2022,"publication_date":"2022-12-13","ids":{"openalex":"https://openalex.org/W2735399061","doi":"https://doi.org/10.1145/3568677","mag":"2735399061"},"language":"en","primary_location":{"id":"doi:10.1145/3568677","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3568677","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 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/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035053302","display_name":"Marek Eli\u00e1\u0161","orcid":"https://orcid.org/0000-0003-4583-8897"},"institutions":[{"id":"https://openalex.org/I71209653","display_name":"Bocconi University","ror":"https://ror.org/05crjpb27","country_code":"IT","type":"education","lineage":["https://openalex.org/I71209653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marek Eli\u00e1\u0161","raw_affiliation_strings":["Bocconi University, Milan, Italy"],"affiliations":[{"raw_affiliation_string":"Bocconi University, Milan, Italy","institution_ids":["https://openalex.org/I71209653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003164174","display_name":"Grigorios Koumoutsos","orcid":"https://orcid.org/0000-0002-4928-103X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grigorios Koumoutsos","raw_affiliation_strings":["Lightcurve GmbH, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Lightcurve GmbH, Berlin, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Utrecht University, CC Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Utrecht University, CC Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.4258,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60941286,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"19","issue":"1","first_page":"1","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9915000200271606,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9674999713897705,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.8049627542495728},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.666947066783905},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.6416835784912109},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6086551547050476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5736706852912903},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5714389681816101},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5460706353187561},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5435239672660828},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.5172565579414368},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4692751467227936},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4610120356082916},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44797977805137634},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4464888274669647},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4302712678909302},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39355549216270447}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8049627542495728},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.666947066783905},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.6416835784912109},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6086551547050476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5736706852912903},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5714389681816101},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5460706353187561},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5435239672660828},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.5172565579414368},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4692751467227936},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4610120356082916},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44797977805137634},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4464888274669647},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4302712678909302},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39355549216270447},{"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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.1145/3568677","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3568677","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7765055871","display_name":null,"funder_award_id":"MISU F 6001 1","funder_id":"https://openalex.org/F4320321390","funder_display_name":"Fonds De La Recherche Scientifique - FNRS"}],"funders":[{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W366602458","https://openalex.org/W1967765145","https://openalex.org/W1979856149","https://openalex.org/W1997424790","https://openalex.org/W1998843748","https://openalex.org/W2006761101","https://openalex.org/W2007840228","https://openalex.org/W2041645394","https://openalex.org/W2054033098","https://openalex.org/W2061319653","https://openalex.org/W2069121074","https://openalex.org/W2069255833","https://openalex.org/W2082099352","https://openalex.org/W2083392624","https://openalex.org/W2086989193","https://openalex.org/W2089998595","https://openalex.org/W2100311357","https://openalex.org/W2113184918","https://openalex.org/W2114538202","https://openalex.org/W2154641120","https://openalex.org/W2163658180","https://openalex.org/W2417597244","https://openalex.org/W2468238604","https://openalex.org/W2592377845","https://openalex.org/W2611296964","https://openalex.org/W2962696710","https://openalex.org/W2963331653","https://openalex.org/W2963631653","https://openalex.org/W2966702489","https://openalex.org/W2994446698","https://openalex.org/W3099267052","https://openalex.org/W3196984656","https://openalex.org/W4212992501"],"related_works":["https://openalex.org/W4301494121","https://openalex.org/W2951569031","https://openalex.org/W2058154701","https://openalex.org/W2038993323","https://openalex.org/W1981660486","https://openalex.org/W3081862881","https://openalex.org/W2569244175","https://openalex.org/W2025735030","https://openalex.org/W2735399061","https://openalex.org/W4300347757"],"abstract_inverted_index":{"The":[0],"generalized":[1],"k":[2,11,35,48,87,96,124,129,142,145,149,152,180],"-server":[3,12],"problem":[4,13,94,114],"is":[5,33,51,71,90,158],"a":[6,34,161,185],"far-reaching":[7],"extension":[8],"of":[9,164,178],"the":[10,60,69,74,79,93,113,120,165,174,200,207],"with":[14,139],"several":[15],"applications.":[16],"Here,":[17,110],"each":[18],"server":[19,56],"s":[20,57],"i":[21,29,58,63,66],"lies":[22],"in":[23,115],"its":[24],"own":[25],"metric":[26],"space":[27],"M":[28,65],".":[30,130],"A":[31],"request":[32],"-tuple":[36],"r":[37,40,43,47,62],"=":[38],"(":[39,86,123,148],"1":[41],",":[42,46,49,67],"2":[44,98,144,179,186,187],",\u2026":[45],"which":[50,196],"served":[52],"by":[53,78],"moving":[54],"some":[55],"to":[59,72,168],"point":[61],"\u2208":[64],"and":[68,108,118,136,146,171],"goal":[70],"minimize":[73],"total":[75],"distance":[76],"traveled":[77],"servers.":[80],"Despite":[81],"much":[82],"work,":[83],"no":[84],"f":[85,122],")-competitive":[88,125],"algorithm":[89,191],"known":[91],"for":[92,95,101,127,192,206],"&gt;":[97],"servers,":[99],"even":[100],"special":[102],"cases":[103],"such":[104],"as":[105],"uniform":[106,116,194],"metrics":[107,117],"lines.":[109],"we":[111,133],"consider":[112],"give":[119,184],"first":[121],"algorithms":[126,138],"general":[128],"In":[131],"particular,":[132],"obtain":[134],"deterministic":[135,156,190],"randomized":[137],"competitive":[140],"ratio":[141],"\u00b7":[143],"O":[147],"3":[150],"log":[151],"),":[153],"respectively.":[154],"Our":[155],"bound":[157,177,205],"based":[159],"on":[160],"novel":[162],"application":[163],"polynomial":[166],"method":[167],"online":[169],"algorithms,":[170],"essentially":[172,198],"matches":[173,199],"long-known":[175],"lower":[176,204],"-1.":[181],"We":[182],"also":[183,197],"O(k)":[188],"-competitive":[189],"weighted":[193],"metrics,":[195],"recent":[201],"doubly":[202],"exponential":[203],"problem.":[208]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}