Skip to main content
SpringerLink
Log in

The k-Server Problem with Advice in d Dimensions and on the Sphere

  • Conference paper
  • First Online:
SOFSEM 2018: Theory and Practice of Computer Science (SOFSEM 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10706))

Abstract

We study the impact of additional information on the hardness of the k-server problem on different metric spaces. To this end, we consider the well-known model of computing with advice. In particular, we design an algorithm for the d-dimensional Euclidean space, which generalizes a known result for the Euclidean plane. As another relevant setting, we investigate a metric space with positive curvature; in particular, the sphere. Both algorithms have constant strict competitive ratios while reading a constant number of advice bits with every request, independent of the number k of servers, and solely depending on parameters of the underlying metric structure.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bansal, N., Buchbinder, N., Mądry, A., Naor, J.: A polylogarithmic-competitive algorithm for the \(k\)-server problem. In: Proceedings of the FOCS 2011, pp. 267–276 (2011)

    Google Scholar 

  2. Böckenhauer, H.-J., Hromkovič, J., Komm, D., Královič, 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–43. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31644-9_2

    Chapter  Google Scholar 

  3. Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T.: On the advice complexity of online problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 331–340. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10631-6_35

    Chapter  Google Scholar 

  4. Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T.: Online algorithms with advice: the tape model. Inf. Comput. 254, 59–83 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  5. Böckenhauer, H.-J., Komm, D., Královič, R., Královič, 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–218. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22006-7_18

    Chapter  Google Scholar 

  6. Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R.: On the advice complexity of the \(k\)-server problem. J. Comput. Syst. Sci. 86, 159–170 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  7. Böckenhauer, H.-J., Komm, D., Královič, R., Rossmanith, P.: The online knapsack problem: advice and randomization. Theoret. Comput. Sci. 527, 61–72 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  9. Boyar, J., Favrholdt, L.M., Kudahl, C., Larsen, K.S., Mikkelsen, J.W.: Online algorithms with advice: a survey. SIGACT News 47(3), 93–129 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  10. Brauchart, J.S., Grabner, P.J.: Distributing many points on spheres: minimal energy and designs. J. Complex. 31(3), 293–326 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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–64. American Mathematical Society (1991)

    Google Scholar 

  12. Chrobak, M., Karloff, H.J., Payne, T.H., Vishwanathan, S.: New results on server problems. SIAM J. Discret. Math. 4(2), 172–181 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. Damelin, S.B., Maymeskul, V.: On point energies, separation radius and mesh norm for \(s\)-extremal configurations on compact sets in \(\mathbb{R}^n\). J. Complex. 21(6), 845–863 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dobrev, S., Edmonds, J., Komm, D., Královič, R., Královič, R., Krug, S., Mömke, T.: Improved analysis of the online set cover problem with advice. Theoret. Comput. Sci. 689, 96–107 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  15. Dobrev, S., Královič, R., Pardubská, D.: How much information about the future is needed? In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 247–258. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77566-9_21

    Chapter  Google Scholar 

  16. Dobrev, S., Královič, R., Pardubská, D.: Measuring the problem-relevant information in input. Theor. Inf. Appl. (RAIRO) 43(3), 585–613 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Dobrev, S., Královič, R., Královič, R.: Computing with advice: when knowledge helps. Bull. EATCS 110, 35–51 (2013)

    MATH  Google Scholar 

  18. Dohrau, J.: Online makespan scheduling with sublinear advice. In: Italiano, G.F., Margaria-Steffen, T., Pokorný, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 177–188. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46078-8_15

    Google Scholar 

  19. Emek, Y., Fraigniaud, P., Korman, A., Rosén, 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–438. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02927-1_36

    Chapter  Google Scholar 

  20. Emek, Y., Fraigniaud, P., Korman, A., Rosén, A.: Online computation with advice. Theoret. Comput. Sci. 412(24), 2642–2656 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  21. Emek, Y., Fraigniaud, P., Korman, A., Rosén, 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–134. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12450-1_12

    Chapter  Google Scholar 

  22. 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

    MATH  Google Scholar 

  23. Gebauer, H., Komm, D., Královič, R., Královič, R., Smula, J.: Disjoint path allocation with sublinear advice. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 417–429. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21398-9_33

    Chapter  Google Scholar 

  24. Gupta, S., Kamali, S., López-Ortiz, A.: On advice complexity of the \(k\)-server problem under sparse metrics. Theory Comput. Syst. 59, 476–499 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  25. Irani, S., Karlin, A.R.: On online computation. In: Hochbaum, D. (ed.) Approximation Algorithms for \(N\!P\)-Hard Problems, pp. 521–564 (1997). Chap. 13

    Google Scholar 

  26. Hromkovič, J., Královič, R., Královič, R.: Information complexity of online problems. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 24–36. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15155-2_3

    Chapter  Google Scholar 

  27. Komm, D.: An Introduction to Online Computation: Determinism, Randomization, Advice. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42749-2

    Book  Google Scholar 

  28. Komm, D., Královič, R.: Advice complexity and barely random algorithms. Theor. Inf. Appl. (RAIRO) 45(2), 249–267 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  29. Koutsoupias, E.: The \(k\)-server problem. Comput. Sci. Rev. 3(2), 105–118 (2009)

    Article  MATH  Google Scholar 

  30. Koutsoupias, E., Papadimitriou, C.H.: On the \(k\)-server conjecture. J. ACM 42(5), 971–983 (1995). Association for Computing Machinery

    Article  MathSciNet  MATH  Google Scholar 

  31. Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for on-line problems. In: Proceedings of the STOC 1988, pp. 322–333. Association for Computing Machinery (1988)

    Google Scholar 

  32. Preparata, F.P., Shamos, M.: Computational Geometry: An Introduction. Springer, New York (1985). https://doi.org/10.1007/978-1-4612-1098-6

    Book  MATH  Google Scholar 

  33. Rakhmanov, E.A., Saff, E.B., Zhou, Y.M.: Minimal discrete energy on the sphere. Math. Res. Lett. 1, 647–662 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  34. Renault, M., Rosén, A.: On online algorithms with advice for the \(k\)-server problem. Theory Comput. Syst. 56(1), 3–21 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  35. Renault, M.P., Rosén, A., van Stee, R.: Online algorithms with advice for bin packing and scheduling problems. Theoret. Comput. Sci. 600, 155–170 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  36. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)

    Article  MathSciNet  Google Scholar 

  37. Zwillinger, D.: Standard Mathematical Tables and Formulae, 32nd edn. CRC, Boca Raton (2011)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, ETH Zurich, Zürich, Switzerland

    Elisabet Burjons & Dennis Komm

  2. CSCS, ETH Zurich, Lugano, Switzerland

    Marcel Schöngens

Authors
  1. Elisabet Burjons
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dennis Komm
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcel Schöngens
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Elisabet Burjons .

Editor information

Editors and Affiliations

  1. Vienna University of Technology , Vienna, Austria

    A Min Tjoa

  2. ISAE-ENSMA, Chasseneuil-du-Poitou, France

    Ladjel Bellatreche

  3. Vienna University of Technology, Vienna, Austria

    Stefan Biffl

  4. Utrecht University, Utrecht, The Netherlands

    Jan van Leeuwen

  5. Academy of Sciences, Prague, Czech Republic

    Jiří Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Burjons, E., Komm, D., Schöngens, M. (2018). The k-Server Problem with Advice in d Dimensions and on the Sphere. In: Tjoa, A., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds) SOFSEM 2018: Theory and Practice of Computer Science. SOFSEM 2018. Lecture Notes in Computer Science(), vol 10706. Edizioni della Normale, Cham. https://doi.org/10.1007/978-3-319-73117-9_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73117-9_28

  • Published:

  • Publisher Name: Edizioni della Normale, Cham

  • Print ISBN: 978-3-319-73116-2

  • Online ISBN: 978-3-319-73117-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation