Prepare for the expected worst: Algorithms for reconfigurable resources under uncertainty

[PDF] arxiv.org

Deterministic tree embeddings with copies for algorithms against adaptive adversaries

B Haeupler, DE Hershkowitz, G Zuzic - arXiv preprint arXiv:2102.05168, 2021 - arxiv.org
Embeddings of graphs into distributions of trees that preserve distances in expectation are a
cornerstone of many optimization algorithms. Unfortunately, online or dynamic algorithms …
被引用次数：3 相关文章 所有 2 个版本
[PDF] ethz.ch

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings

B Haepler, DE Hershkowitz… - … on Algorithms (ESA …, 2022 - research-collection.ethz.ch
Embeddings of graphs into distributions of trees that preserve distances in expectation are a
cornerstone of many optimization algorithms. Unfortunately, online or dynamic algorithms …
相关文章 所有 8 个版本