@InProceedings{berendsohn_et_al:LIPIcs.ICALP.2023.19,
  author =	{Berendsohn, Benjamin Aram and Golinsky, Ishay and Kaplan, Haim and Kozma, L\'{a}szl\'{o}},
  title =	{{Fast Approximation of Search Trees on Trees with Centroid Trees}},
  booktitle =	{50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
  pages =	{19:1--19:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-278-5},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{261},
  editor =	{Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.19},
  URN =		{urn:nbn:de:0030-drops-180711},
  doi =		{10.4230/LIPIcs.ICALP.2023.19},
  annote =	{Keywords: centroid tree, search trees on trees, approximation}
}