Adding Isolated Vertices Makes Some Online Algorithms Optimal

  • Joan Boyar
  • Christian Kudahl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9538)


An unexpected difference between online and offline algorithms is observed. The natural greedy algorithms are shown to be worst case online optimal for Online Independent Set and Online Vertex Cover on graphs with “enough” isolated vertices, Freckle Graphs. For Online Dominating Set, the greedy algorithm is shown to be worst case online optimal on graphs with at least one isolated vertex. These algorithms are not online optimal in general. The online optimality results for these greedy algorithms imply optimality according to various worst case performance measures, such as the competitive ratio. It is also shown that, despite this worst case optimality, there are Freckle graphs where the greedy independent set algorithm is objectively less good than another algorithm.

It is shown that it is NP-hard to determine any of the following for a given graph: the online independence number, the online vertex cover number, and the online domination number.



The authors would like to thank Lene Monrad Favrholdt for interesting and helpful discussions.


  1. 1.
    Allan, R.B., Laskar, R.: On domination and independent domination numbers of a graph. Discrete Math. 23(2), 73–76 (1978)CrossRefMathSciNetzbMATHGoogle Scholar
  2. 2.
    Angelopoulos, S., Dorrigiv, R., López-Ortiz, A.: On the separation and equivalence of paging strategies. In: 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 229–237 (2007)Google Scholar
  3. 3.
    Boyar, J., Favrholdt, L.M.: The relative worst order ratio for online algorithms. ACM Trans. Algorithm 3(2), 22 (2007)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Boyar, J., Favrholdt, L.M., Medvedev, P.: The relative worst order ratio of online bipartite graph coloring, Unpublished manuscriptGoogle Scholar
  5. 5.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979). Under Dominating Set on p. 190Google Scholar
  6. 6.
    Gyárfás, A., Király, Z., Lehel, J.: On-line competitive coloring algorithms. Tech. rep. TR-9703-1, Institute of Mathematics at Eötvös Loránd University (1997).
  7. 7.
    Gyárfás, A., Király, Z., Lehel, J.: On-line 3-chromatic graphs I. Triangle-free graphs. SIAM J. Discrete Math. 12, 385–411 (1999)CrossRefMathSciNetzbMATHGoogle Scholar
  8. 8.
    Gyárfás, A., Lehel, J.: First fit and on-line chromatic number of families of graphs. ARS Combinatoria 29C, 168–176 (1990)zbMATHGoogle Scholar
  9. 9.
    Halldórsson, M.M.: Online coloring known graphs. In: 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 917–918 (1999)Google Scholar
  10. 10.
    Halldórsson, M.M., Iwama, K., Miyazaki, S., Taketomi, S.: Online independent sets. Theoret. Comput. Sci. 289(2), 953–962 (2002)CrossRefMathSciNetzbMATHGoogle Scholar
  11. 11.
    Kudahl, C.: Deciding the on-line chromatic number of a graph with pre-coloring is PSPACE-complete. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 313–324. Springer, Heidelberg (2015)CrossRefGoogle Scholar
  12. 12.
    Lehel, A.G.J., Kiraly, Z.: On-line graph coloring and finite basis problems. Combinatorics: Paul Erdos is Eighty 1, 207–214 (1993)MathSciNetGoogle Scholar
  13. 13.
    Lovász, L., Saks, M., Trotter, W.: An on-line graph coloring algorithm with sublinear performance ratio. Discrete Math. 75(13), 319–325 (1989)CrossRefMathSciNetzbMATHGoogle Scholar
  14. 14.
    Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Vishwanathan, S.: Randomized online graph coloring. J. Algorithms 13(4), 657–669 (1992)CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceUniversity of Southern DenmarkOdenseDenmark

Personalised recommendations