{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:39Z","timestamp":1740109299206,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T00:00:00Z","timestamp":1537315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s00453-018-0514-6","type":"journal-article","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T13:48:31Z","timestamp":1537364911000},"page":"1859-1880","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The k-Server Problem with Advice in d Dimensions and on the Sphere"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6161-7440","authenticated-orcid":false,"given":"Elisabet","family":"Burjons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Komm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Sch\u00f6ngens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,19]]},"reference":[{"key":"514_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Buchbinder, N., M\u0105dry, A., Naor, J.: A polylogarithmic-competitive algorithm for the $$k$$ k -server problem. In: Proceedings of FOCS 2011, pp. 267\u2013276 (2011)","DOI":"10.1109\/FOCS.2011.63"},{"key":"514_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer, H.J.., Hromkovi\u010d,J., Komm, D., Kr\u00e1lovi\u010d, R., Rossmanith, P.: On the power of randomness versus advice in online computation. In Bordihn, H., Kutrib, M., Truthe, B. (eds.) Languages Alive: Essays Dedicated to J\u00fcrgen Dassow on the Occasion of His 65th Birthday, LNCS 7300. Springer (2012)","DOI":"10.1007\/978-3-642-31644-9_2"},{"key":"514_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer, H.J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: On the advice complexity of online problems. In: Proceedings of ISAAC 2009, LNCS 5478, pp. 331\u2013340 (2009)","DOI":"10.1007\/978-3-642-10631-6_35"},{"key":"514_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ic.2017.03.001","volume":"254","author":"H-J B\u00f6ckenhauer","year":"2017","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: Online algorithms with advice: the tape model. Inf. Comput. 254, 59\u201383 (2017)","journal-title":"Inf. Comput."},{"key":"514_CR5","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer, H.J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: On the advice complexity of the $$k$$ k -server problem. In: Proceedings of ICALP 2011, LNCS 6755, pp. 207\u2013218 (2011)","DOI":"10.1007\/978-3-642-22006-7_18"},{"key":"514_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jcss.2017.01.001","volume":"86","author":"H-J B\u00f6ckenhauer","year":"2017","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: On the advice complexity of the $$k$$ k -server problem. J. Comput. Syst. Sci. 86, 159\u2013170 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"514_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2014.01.027","volume":"527","author":"H-J B\u00f6ckenhauer","year":"2014","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Rossmanith, P.: The online knapsack problem: advice and randomization. Theor. Comput. Sci. 527, 61\u201372 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"514_CR8","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"3","key":"514_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/2993749.2993766","volume":"47","author":"J Boyar","year":"2016","unstructured":"Boyar, J., Favrholdt, L.M., Kudahl, C., Larsen, K.S., Mikkelsen, J.W.: Online algorithms with advice: a survey. SIGACT News 47(3), 93\u2013129 (2016)","journal-title":"SIGACT News"},{"issue":"3","key":"514_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.jco.2015.02.003","volume":"31","author":"JS Brauchart","year":"2015","unstructured":"Brauchart, J.S., Grabner, P.J.: Distributing many points on spheres: minimal energy and designs. J. Complex. 31(3), 293\u2013326 (2015)","journal-title":"J. Complex."},{"key":"514_CR11","doi-asserted-by":"crossref","unstructured":"Burjons, E., Komm, D., Sch\u00f6ngens, M.: The $$k$$ k -server problem with advice in d dimensions and on the sphere. In: Proceedings of SOFSEM 2018, LNCS 10706, pp.\u00a0155\u2013166. Springer (2018)","DOI":"10.1007\/978-3-319-73117-9_28"},{"key":"514_CR12","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Larmore, L.: The server problem and online games. In: On-Line Algorithms, Proceedings of a DIMACS Workshop, Volume 7 of DIMACS Series in Discrete Mathematics and Computer Science, pp.\u00a011\u201364. American Mathematical Society (1991)","DOI":"10.1090\/dimacs\/007\/02"},{"issue":"2","key":"514_CR13","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M Chrobak","year":"1991","unstructured":"Chrobak, M., Karloff, H.J., Payne, T.H., Vishwanathan, S.: New results on server problems. SIAM J. Discrete Math. 4(2), 172\u2013181 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"514_CR14","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.jco.2005.04.005","volume":"21","author":"SB Damelin","year":"2005","unstructured":"Damelin, S.B., Maymeskul, V.: On point energies, separation radius and mesh norm for $$s$$ s -extremal configurations on compact sets in $$^n$$ n . J. Complex. 21(6), 845\u2013863 (2005)","journal-title":"J. Complex."},{"key":"514_CR15","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2017.05.029","volume":"689","author":"S Dobrev","year":"2017","unstructured":"Dobrev, S., Edmonds, J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., Krug, S., M\u00f6mke, T.: Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. 689, 96\u2013107 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"514_CR16","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: How much information about the future is needed? In: Proceedings\u00a0of SOFSEM\u00a02008, LNCS 4910, pp.\u00a0247\u2013258. Springer (2008)","DOI":"10.1007\/978-3-540-77566-9_21"},{"issue":"3","key":"514_CR17","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1051\/ita\/2009012","volume":"43","author":"S Dobrev","year":"2009","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: Measuring the problem-relevant information in input. Theor. Inform. Appl. (RAIRO) 43(3), 585\u2013613 (2009)","journal-title":"Theor. Inform. Appl. (RAIRO)"},{"key":"514_CR18","first-page":"35","volume":"110","author":"S Dobrev","year":"2013","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: Computing with advice: when knowledge helps. Bull. EATCS 110, 35\u201351 (2013)","journal-title":"Bull. EATCS"},{"key":"514_CR19","doi-asserted-by":"crossref","unstructured":"Dohrau, J,: Online makespan scheduling with sublinear advice. In: Proceedings\u00a0of SOFSEM 2015, LNCS 8939, pp.\u00a0177\u2013188. Springer (2015)","DOI":"10.1007\/978-3-662-46078-8_15"},{"key":"514_CR20","doi-asserted-by":"crossref","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Ros\u00e9n. A.: Online computation with advice. In: Proceedings of ICALP\u00a02009, LNCS 5555, pp.\u00a0427\u2013438. Springer (2009)","DOI":"10.1007\/978-3-642-02927-1_36"},{"issue":"24","key":"514_CR21","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1016\/j.tcs.2010.08.007","volume":"412","author":"Y Emek","year":"2011","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Ros\u00e9n, A.: Online computation with advice. Theor. Comput. Sci. 412(24), 2642\u20132656 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"514_CR22","doi-asserted-by":"crossref","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Ros\u00e9n, A.: On the additive constant of the $$k$$ k -server work function algorithm. In: Proceedings of the WAOA\u00a02009, LNCS 5893. Springer (2011)","DOI":"10.1007\/978-3-642-12450-1_12"},{"key":"514_CR23","doi-asserted-by":"crossref","unstructured":"Fiat, A., Woeginger, G.J. (eds.): Online Algorithms\u2014The State of the Art, LNCS 1442. Springer (1998)","DOI":"10.1007\/BFb0029561"},{"key":"514_CR24","doi-asserted-by":"crossref","unstructured":"Gebauer, H., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., Smula, J.: Disjoint path allocation with sublinear advice. In: Proceedings\u00a0of COCOON 2015, LNCS 9198, pp.\u00a0417\u2013429. Springer (2015)","DOI":"10.1007\/978-3-319-21398-9_33"},{"key":"514_CR25","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/s00224-015-9649-x","volume":"59","author":"S Gupta","year":"2016","unstructured":"Gupta, S., Kamali, S., L\u00f3pez-Ortiz, A.: On advice complexity of the $$k$$ k -server problem under sparse metrics. Theory Comput. Syst. 59, 476\u2013499 (2016)","journal-title":"Theory Comput. Syst."},{"key":"514_CR26","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: Information complexity of online problems. In: Proceedings of MFCS\u00a02010, LNCS 6281, pp.\u00a024\u201336. Springer (2010)","DOI":"10.1007\/978-3-642-15155-2_3"},{"key":"514_CR27","unstructured":"Irani, S., Karlin , A.R.: On online computation. In: Hochbaum ,D. (ed.) Approximation Algorithms for $$N\\!P$$ N P -Hard Problems, chapter 13, pp.\u00a0521\u2013564 (1997)"},{"key":"514_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42749-2","volume-title":"An Introduction to Online Computation: Determinism, Randomization, Advice","author":"D Komm","year":"2016","unstructured":"Komm, D.: An Introduction to Online Computation: Determinism, Randomization, Advice. Springer, Berlin (2016)"},{"issue":"2","key":"514_CR29","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1051\/ita\/2011105","volume":"45","author":"D Komm","year":"2011","unstructured":"Komm, D., Kr\u00e1lovi\u010d, R.: Advice complexity and barely random algorithms. Theor. Inform. Appl. (RAIRO) 45(2), 249\u2013267 (2011)","journal-title":"Theor. Inform. Appl. (RAIRO)"},{"issue":"2","key":"514_CR30","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cosrev.2009.04.002","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E.: The $$k$$ k -server problem. Comput. Sci. Rev. 3(2), 105\u2013118 (2009)","journal-title":"Comput. Sci. Rev."},{"issue":"5","key":"514_CR31","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, ChH: On the $$k$$ k -server conjecture. J. ACM Assoc. Comput. Mach. 42(5), 971\u2013983 (1995)","journal-title":"J. ACM Assoc. Comput. Mach."},{"key":"514_CR32","doi-asserted-by":"crossref","unstructured":"Manasse, M.S., McGeoch, L.A., Sleator, DD.: Competitive algorithms for on-line problems. In: Proceedings of STOC\u00a01988, pp.\u00a0322\u2013333. Association for Computing Machinery (1988)","DOI":"10.1145\/62212.62243"},{"key":"514_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.: Computational Geometry: An Introduction. Springer, Berlin (1985)"},{"key":"514_CR34","doi-asserted-by":"publisher","first-page":"647","DOI":"10.4310\/MRL.1994.v1.n6.a3","volume":"1","author":"EA Rakhmanov","year":"1994","unstructured":"Rakhmanov, E.A., Saff, E.B., Zhou, Y.M.: Minimal discrete energy on the sphere. Math. Res. Lett. 1, 647\u2013662 (1994)","journal-title":"Math. Res. Lett."},{"issue":"1","key":"514_CR35","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00224-012-9434-z","volume":"56","author":"MP Renault","year":"2015","unstructured":"Renault, M.P., Ros\u00e9n, A.: On online algorithms with advice for the $$k$$ k -server problem. Theory Comput. Syst. 56(1), 3\u201321 (2015)","journal-title":"Theory Comput. Syst."},{"key":"514_CR36","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2015.07.050","volume":"600","author":"MP Renault","year":"2015","unstructured":"Renault, M.P., Ros\u00e9n, A., van Stee, R.: Online algorithms with advice for bin packing and scheduling problems. Theor. Comput. Sci. 600, 155\u2013170 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"514_CR37","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"514_CR38","doi-asserted-by":"crossref","DOI":"10.1201\/b10980","volume-title":"Standard Mathematical Tables and Formulae","author":"D Zwillinger","year":"2011","unstructured":"Zwillinger, D.: Standard Mathematical Tables and Formulae, 32nd edn. CRC, Boca Raton (2011)","edition":"32"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0514-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0514-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0514-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T06:58:40Z","timestamp":1693897120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0514-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,19]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["514"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0514-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,9,19]]},"assertion":[{"value":"5 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}