Advertisement

On Advice Complexity of the k-server Problem under Sparse Metrics

  • Sushmita Gupta
  • Shahin Kamali
  • Alejandro López-Ortiz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8179)

Abstract

We consider the k-Server problem under the advice model of computation when the underlying metric space is sparse. On one side, we introduce Θ(1)-competitive algorithms for a wide range of sparse graphs, which require advice of (almost) linear size. Namely, we show that for graphs of size N and treewidth α, there is an online algorithm which receives O(n(log α + log log N)) bits of advice and optimally serves a sequence of length n. With a different argument, we show that if a graph admits a system of μ collective tree (q,r)- spanners, then there is a (q + r)-competitive algorithm which receives O(n(log μ + log log N)) bits of advice. Among other results, this gives a 3-competitive algorithm for planar graphs, provided with O(n log log N) bits of advice. On the other side, we show that an advice of size Ω(n) is required to obtain a 1-competitive algorithm for sequences of size n even for the 2-server problem on a path metric of size N ≥ 5. Through another lower bound argument, we show that at least \(\frac{n}{2}({\rm log} \alpha- 1.22)\) bits of advice is required to obtain an optimal solution for metric spaces of treewidth α, where 4 ≤ α < 2k.

Keywords

Competitive Ratio Online Algorithm Tree Decomposition Chordal Graph Unit Disk Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bartal, Y., Koutsoupias, E.: On the competitive ratio of the work function algorithm for the k-server problem. Theoret. Comput. Sci. 324, 337–345 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bein, W.W., Chrobak, M., Larmore, L.L.: The 3-server problem in the plane. Theoret. Comput. Sci. 289(1), 335–354 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bein, W.W., Iwama, K., Kawahara, J., Larmore, L.L., Oravec, J.A.: A randomized algorithm for two servers in cross polytope spaces. Theoret. Comput. Sci. 412(7), 563–572 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bianchi, M.P., Böckenhauer, H.-J., Hromkovič, J., Keller, L.: Online coloring of bipartite graphs with and without advice. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 519–530. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  5. 5.
    Böckenhauer, H.-J., Hromkovič, J., Komm, D., Krug, S., Smula, J., Sprock, A.: The string guessing problem as a method to prove lower bounds on the advice complexity. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 493–505. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  6. 6.
    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, Part I. LNCS, vol. 6755, pp. 207–218. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Böckenhauer, H.-J., Komm, D., Královič, R., Rossmanith, P.: On the advice complexity of the knapsack problem. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 61–72. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  9. 9.
    Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernet. 11, 1–23 (1993)Google Scholar
  10. 10.
    Chrobak, M., Larmore, L.L.: An optimal online algorithm for k-servers on trees. SIAM J. Comput. 20, 144–148 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Dobrev, S., Královič, R., Markou, E.: Online graph exploration with advice. In: Even, G., Halldórsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 267–278. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  12. 12.
    Dragan, F.F., Yan, C., Corneil, D.G.: Collective tree spanners and routing in at-free related graphs. J. Graph Algorithms Appl. 10(2), 97–122 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Dragan, F.F., Yan, C., Lomonosov, I.: Collective tree spanners of graphs. SIAM J. Discrete Math. 20(1), 241–260 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Emek, Y., Fraigniaud, P., Korman, A., Rosén, A.: Online computation with advice. Theor. Comput. Sci. 412(24), 2642–2656 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Farzan, A., Kamali, S.: Compact navigation and distance oracles for graphs with small treewidth. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 268–280. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  16. 16.
    Forišek, M., Keller, L., Steinová, M.: Advice complexity of online coloring for paths. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 228–239. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  17. 17.
    Gupta, A., Kumar, A., Rastogi, R.: Traveling with a pez dispenser (or, routing issues in mpls). SIAM J. Comput. 34(2), 453–474 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    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)CrossRefGoogle Scholar
  19. 19.
    Karlin, A.R., Manasse, M.S., McGeoch, L.A., Owicki, S.: Competitive randomized algorithms for non-uniform problems. In: Johnson, D.S. (ed.) SODA 1990, pp. 301–309 (1990)Google Scholar
  20. 20.
    Komm, D., Královič, R., Mömke, T.: On the advice complexity of the set cover problem. In: Hirsch, E.A., Karhumäki, J., Lepistö, A., Prilutskii, M. (eds.) CSR 2012. LNCS, vol. 7353, pp. 241–252. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  21. 21.
    Komm, D., Královič, R.: Advice complexity and barely random algorithms. In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 332–343. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  22. 22.
    Manasse, M., McGeoch, L.A., Sleator, D.: Competitive algorithms for online problems. In: Simon, J. (ed.) STOC 1988, pp. 322–333 (1988)Google Scholar
  23. 23.
    Renault, M.P., Rosén, A.: On online algorithms with advice for the k-server problem. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 198–210. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  24. 24.
    Yan, C., Xiang, Y., Dragan, F.F.: Compact and low delay routing labeling scheme for unit disk graphs. Comput. Geom. 45(7), 305–325 (2012)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Sushmita Gupta
    • 1
  • Shahin Kamali
    • 2
  • Alejandro López-Ortiz
    • 2
  1. 1.University of Southern DenmarkOdenseDenmark
  2. 2.Cheriton School of Computer ScienceUniversity of WaterlooOntarioCanada

Personalised recommendations