{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:01:01Z","timestamp":1773327661808,"version":"3.50.1"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T00:00:00Z","timestamp":1478044800000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF-0829878"],"award-info":[{"award-number":["CCF-0829878"]}]},{"name":"NWO Vidi","award":["639.022.211"],"award-info":[{"award-number":["639.022.211"]}]},{"name":"ISF","award":["954\/11"],"award-info":[{"award-number":["954\/11"]}]},{"name":"ONR","award":["N00014-11-1-0053"],"award-info":[{"award-number":["N00014-11-1-0053"]}]},{"name":"BSF","award":["2010426"],"award-info":[{"award-number":["2010426"]}]},{"name":"ERC consolidator","award":["617951"],"award-info":[{"award-number":["617951"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2015,11,2]]},"abstract":"<jats:p>\n                    We give the first polylogarithmic-competitive randomized online algorithm for the\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of \u00d5(log\n                    <jats:sup>3<\/jats:sup>\n                    <jats:italic toggle=\"yes\">n<\/jats:italic>\n                    log\n                    <jats:sup>2<\/jats:sup>\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    ) for any metric space on\n                    <jats:italic toggle=\"yes\">n<\/jats:italic>\n                    points. Our algorithm improves upon the deterministic (2\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -1)-competitive algorithm of Koutsoupias and Papadimitriou [Koutsoupias and Papadimitriou 1995] for a wide range of\n                    <jats:italic toggle=\"yes\">n<\/jats:italic>\n                    .\n                  <\/jats:p>","DOI":"10.1145\/2783434","type":"journal-article","created":{"date-parts":[[2015,11,2]],"date-time":"2015-11-02T12:09:35Z","timestamp":1446466175000},"page":"1-49","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["A Polylogarithmic-Competitive Algorithm for the\n                    <i>k<\/i>\n                    -Server Problem"],"prefix":"10.1145","volume":"62","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[{"name":"Technical University of Eindhoven"}]},{"given":"Niv","family":"Buchbinder","sequence":"additional","affiliation":[{"name":"Tel Aviv University"}]},{"given":"Aleksander","family":"Madry","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Joseph (Seffi)","family":"Naor","sequence":"additional","affiliation":[{"name":"Technion"}]}],"member":"320","published-online":{"date-parts":[[2015,11,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00116-9"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339123.2339126"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873606"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_25"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875536"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258667"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.008"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331606"},{"key":"e_1_2_1_10_1","volume-title":"On metric Ramsey-type phenomena. Ann. of Math. 162-2, 2","author":"Bartal Yair","year":"2005","unstructured":"Yair Bartal, Nathan Linial, Manor Mendel, and Assaf Naor. 2005. On metric Ramsey-type phenomena. Ann. of Math. 162-2, 2 (2005)."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796507"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799351882"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/290169"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404017"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220008"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374411"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v29:1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780608"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376159"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80060-1"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103448"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/210118.210128"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90003-W"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759073"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2009.02.005"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2002.3144"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783434","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2783434","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2783434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:37:20Z","timestamp":1763458640000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,2]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,11,2]]}},"alternative-id":["10.1145\/2783434"],"URL":"https:\/\/doi.org\/10.1145\/2783434","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,2]]},"assertion":[{"value":"2014-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-05-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-11-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}