Routing schemes for hybrid communication networks

DOI10.1016/j.tcs.2023.114352arXiv2210.05333MaRDI QIDQ6145044

Artur Czumaj, Christian Scheideler, Julian Werthmann, Unnamed Author, Philipp Schneider

Publication date: 8 January 2024

Published in: Theoretical Computer Science, Structural Information and Communication Complexity (Search for Journal in Brave)

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

zbMATH Keywords

routing schemeshybrid networksunit-disk graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Theory of computing (68Qxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Unnamed Item
• A bounding box overlay for competitive routing in hybrid communication networks
• Fast Partial Distance Estimation and Applications
• Geometric ad-hoc routing
• Distributed Verification and Hardness of Distributed Approximation
• Plain SINR is Enough!
• Shortest Paths in a Hybrid Network Model
• On Efficient Distributed Construction of Near Optimal Routing Schemes
• Fast routing table construction using small messages
• Computing Shortest Paths and Diameter in the Hybrid Network Model
• Routing with guaranteed delivery in ad hoc wireless networks
• Undirected (1+ 𝜀 )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms

This page was built for publication: Routing schemes for hybrid communication networks