Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality

DOI10.1145/3519935.3520026MaRDI QIDQ6083586zbMATH OpenWikidataFDO

Authors Bernhard Haeupler, Harald Räcke, Mohsen Ghaffari

Publication date 8 December 2023

Published in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3519935.3520026

zbMATH Keywords

distributed packet routingexpander decompositionoblivious routing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(6)

• Optimal electrical oblivious routing on expanders
• Electrical flows for polylogarithmic competitive oblivious routing
• Deterministic expander routing: faster and more versatile
• Graph decompositions and length-constrained expanders (invited talk)
• Length-constrained directed expander decomposition and length-constrained vertex-capacitated flow shortcuts
• hop-constrained oblivious routing

This page was built for publication: Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083586)