Tree embeddings for hop-constrained network design

DOI10.1145/3406325.3451053arXiv2011.06112OpenAlexW3168169702MaRDI QIDQ6087007

Goran Zuzic, Bernhard Haeupler, D. Ellis Hershkowitz

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.06112

zbMATH Keywords

approximation algorithmstree embeddingshop-constrained distanceshop-constrained network design

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast ⋮ On Hop-Constrained Steiner Trees in Tree-Like Metrics

This page was built for publication: Tree embeddings for hop-constrained network design