License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2022.63
URN: urn:nbn:de:0030-drops-170016
URL: https://drops.dagstuhl.de/opus/volltexte/2022/17001/
Go to the corresponding LIPIcs Volume Portal


Haepler, Bernhard ; Hershkowitz, D. Ellis ; Zuzic, Goran

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings

pdf-format:
LIPIcs-ESA-2022-63.pdf (0.8 MB)


Abstract

Embeddings of graphs into distributions of trees that preserve distances in expectation are a cornerstone of many optimization algorithms. Unfortunately, online or dynamic algorithms which use these embeddings seem inherently randomized and ill-suited against adaptive adversaries.
In this paper we provide a new tree embedding which addresses these issues by deterministically embedding a graph into a single tree containing O(log n) copies of each vertex while preserving the connectivity structure of every subgraph and O(logĀ² n)-approximating the cost of every subgraph. Using this embedding we obtain the first deterministic bicriteria approximation algorithm for the online covering Steiner problem as well as the first poly-log approximations for demand-robust Steiner forest, group Steiner tree and group Steiner forest.

BibTeX - Entry

@InProceedings{haepler_et_al:LIPIcs.ESA.2022.63,
  author =	{Haepler, Bernhard and Hershkowitz, D. Ellis and Zuzic, Goran},
  title =	{{Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings}},
  booktitle =	{30th Annual European Symposium on Algorithms (ESA 2022)},
  pages =	{63:1--63:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-247-1},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{244},
  editor =	{Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/17001},
  URN =		{urn:nbn:de:0030-drops-170016},
  doi =		{10.4230/LIPIcs.ESA.2022.63},
  annote =	{Keywords: Tree metrics, metric embeddings, approximation algorithms, group Steiner forest, group Steiner tree, demand-robust algorithms, online algorithms, deterministic algorithms}
}

Keywords: Tree metrics, metric embeddings, approximation algorithms, group Steiner forest, group Steiner tree, demand-robust algorithms, online algorithms, deterministic algorithms
Collection: 30th Annual European Symposium on Algorithms (ESA 2022)
Issue Date: 2022
Date of publication: 01.09.2022


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI