Hop-constrained oblivious routing

DOI10.1145/3406325.3451098arXiv2011.10446OpenAlexW3172739028MaRDI QIDQ6065245

Goran Zuzic, Mohsen Ghaffari, Bernhard Haeupler

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.10446

zbMATH Keywords

dilationcongestionHop constraintsoblivious routingHop-constrained oblivious routingpartial tree embeddings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Sparse Semi-Oblivious Routing: Few Random Paths Suffice

This page was built for publication: Hop-constrained oblivious routing