@InProceedings{kobayashi:LIPIcs.ISAAC.2017.52,
  author =	{Kobayashi, Koji M.},
  title =	{{Improved Bounds for Online Dominating Sets of Trees}},
  booktitle =	{28th International Symposium on Algorithms and Computation (ISAAC 2017)},
  pages =	{52:1--52:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-054-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{92},
  editor =	{Okamoto, Yoshio and Tokuyama, Takeshi},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.52},
  URN =		{urn:nbn:de:0030-drops-82364},
  doi =		{10.4230/LIPIcs.ISAAC.2017.52},
  annote =	{Keywords: online algorithm, dominating set, competitive analysis, tree graph, randomized algorithm}
}