%0 Conference Paper %1 conf/icalp/BerendsohnGK023 %A Berendsohn, Benjamin Aram %A Golinsky, Ishay %A Kaplan, Haim %A Kozma, László %B ICALP %D 2023 %E Etessami, Kousha %E Feige, Uriel %E Puppis, Gabriele %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 19:1-19:20 %T Fast Approximation of Search Trees on Trees with Centroid Trees. %U http://dblp.uni-trier.de/db/conf/icalp/icalp2023.html#BerendsohnGK023 %V 261 %@ 978-3-95977-278-5

@inproceedings{conf/icalp/BerendsohnGK023, added-at = {2023-07-05T00:00:00.000+0200}, author = {Berendsohn, Benjamin Aram and Golinsky, Ishay and Kaplan, Haim and Kozma, László}, biburl = {https://www.bibsonomy.org/bibtex/2560204b7e495961c5d879670bf25d95c/dblp}, booktitle = {ICALP}, crossref = {conf/icalp/2023}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, ee = {https://doi.org/10.4230/LIPIcs.ICALP.2023.19}, interhash = {38a2cb8e20ff31eb07b3a2e6460f34bd}, intrahash = {560204b7e495961c5d879670bf25d95c}, isbn = {978-3-95977-278-5}, keywords = {dblp}, pages = {19:1-19:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-09T13:35:21.000+0200}, title = {Fast Approximation of Search Trees on Trees with Centroid Trees.}, url = {http://dblp.uni-trier.de/db/conf/icalp/icalp2023.html#BerendsohnGK023}, volume = 261, year = 2023 }