{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:50:54Z","timestamp":1725936654026},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319731162"},{"type":"electronic","value":"9783319731179"}],"license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73117-9_28","type":"book-chapter","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T16:45:34Z","timestamp":1513874734000},"page":"396-409","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The k-Server Problem with Advice in\u00a0d\u00a0Dimensions and on the Sphere"],"prefix":"10.1007","author":[{"given":"Elisabet","family":"Burjons","sequence":"first","affiliation":[]},{"given":"Dennis","family":"Komm","sequence":"additional","affiliation":[]},{"given":"Marcel","family":"Sch\u00f6ngens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"key":"28_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 the FOCS 2011, pp. 267\u2013276 (2011)","DOI":"10.1109\/FOCS.2011.63"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-31644-9_2","volume-title":"Languages Alive","author":"H-J B\u00f6ckenhauer","year":"2012","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. LNCS, vol. 7300, pp. 30\u201343. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31644-9_2"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-10631-6_35","volume-title":"Algorithms and Computation","author":"H-J B\u00f6ckenhauer","year":"2009","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: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 331\u2013340. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_35"},{"key":"28_CR4","doi-asserted-by":"crossref","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":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-22006-7_18","volume-title":"Automata, Languages and Programming","author":"H-J B\u00f6ckenhauer","year":"2011","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: On the advice complexity of the k-server problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 207\u2013218. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_18"},{"key":"28_CR6","doi-asserted-by":"crossref","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":"28_CR7","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 527, 61\u201372 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"28_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":"28_CR9","doi-asserted-by":"crossref","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":"28_CR10","doi-asserted-by":"crossref","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":"28_CR11","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Larmore, L.: The server problem and online games. In: On-line Algorithms, Proceedings of a DIMACS Workshop. DIMACS Series in Discrete Mathematics and Computer Science. vol. 7, pp. 11\u201364. American Mathematical Society (1991)","DOI":"10.1090\/dimacs\/007\/02"},{"issue":"2","key":"28_CR12","doi-asserted-by":"crossref","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. Discret. Math. 4(2), 172\u2013181 (1991)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"28_CR13","doi-asserted-by":"crossref","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 $$\\mathbb{R}^n$$ R n . J. Complex. 21(6), 845\u2013863 (2005)","journal-title":"J. Complex."},{"key":"28_CR14","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 689, 96\u2013107 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-77566-9_21","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"S Dobrev","year":"2008","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: How much information about the future is needed? In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 247\u2013258. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77566-9_21"},{"issue":"3","key":"28_CR16","doi-asserted-by":"crossref","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. Inf. Appl. (RAIRO) 43(3), 585\u2013613 (2009)","journal-title":"Theor. Inf. Appl. (RAIRO)"},{"key":"28_CR17","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":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-662-46078-8_15","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science","author":"J Dohrau","year":"2015","unstructured":"Dohrau, J.: Online makespan scheduling with sublinear advice. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 177\u2013188. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46078-8_15"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-02927-1_36","volume-title":"Automata, Languages and Programming","author":"Y Emek","year":"2009","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Ros\u00e9n, A.: Online computation with advice. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 427\u2013438. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_36"},{"issue":"24","key":"28_CR20","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 412(24), 2642\u20132656 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-12450-1_12","volume-title":"Approximation and Online Algorithms","author":"Y Emek","year":"2010","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Ros\u00e9n, A.: On the additive constant of the k-server work function algorithm. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol. 5893, pp. 128\u2013134. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12450-1_12"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029561","volume-title":"Online Algorithms: The State of the Art","year":"1998","unstructured":"Fiat, A., Woeginger, G.J. (eds.): Online Algorithms: The State of the Art. LNCS, vol. 1442. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0029561"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-319-21398-9_33","volume-title":"Computing and Combinatorics","author":"H Gebauer","year":"2015","unstructured":"Gebauer, H., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., Smula, J.: Disjoint path allocation with sublinear advice. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 417\u2013429. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21398-9_33"},{"key":"28_CR24","doi-asserted-by":"crossref","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":"28_CR25","unstructured":"Irani, S., Karlin, A.R.: On online computation. In: Hochbaum, D. (ed.) Approximation Algorithms for $$N\\!P$$ N P -Hard Problems, pp. 521\u2013564 (1997). Chap. 13"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-15155-2_3","volume-title":"Mathematical Foundations of Computer Science 2010","author":"J Hromkovi\u010d","year":"2010","unstructured":"Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: Information complexity of online problems. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 24\u201336. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15155-2_3"},{"key":"28_CR27","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, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42749-2"},{"issue":"2","key":"28_CR28","doi-asserted-by":"crossref","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. Inf. Appl. (RAIRO) 45(2), 249\u2013267 (2011)","journal-title":"Theor. Inf. Appl. (RAIRO)"},{"issue":"2","key":"28_CR29","doi-asserted-by":"crossref","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":"28_CR30","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: On the $$k$$ k -server conjecture. J. ACM 42(5), 971\u2013983 (1995). Association for Computing Machinery","journal-title":"J. ACM"},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for on-line problems. In: Proceedings of the STOC 1988, pp. 322\u2013333. Association for Computing Machinery (1988)","DOI":"10.1145\/62212.62243"},{"key":"28_CR32","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, New York (1985). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6"},{"key":"28_CR33","doi-asserted-by":"crossref","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":"28_CR34","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00224-012-9434-z","volume":"56","author":"M Renault","year":"2015","unstructured":"Renault, M., 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":"28_CR35","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 600, 155\u2013170 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"28_CR36","doi-asserted-by":"crossref","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":"28_CR37","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":["Lecture Notes in Computer Science","SOFSEM 2018: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73117-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T11:46:13Z","timestamp":1570535173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73117-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"ISBN":["9783319731162","9783319731179"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73117-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}