Near-Optimal Distributed Routing with Low Memory

From MaRDI portal

Revision as of 16:50, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5197685

Jump to:navigation, search

DOI10.1145/3212734.3212761zbMath1428.68373OpenAlexW2810930637WikidataQ130877459 ScholiaQ130877459MaRDI QIDQ5197685

Ofer Neiman, Michael Elkin

Publication date: 19 September 2019

Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

compact routing Congest

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs ⋮ Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC

This page was built for publication: Near-Optimal Distributed Routing with Low Memory

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5197685&oldid=19787402"