Competitive routing in hybrid communication networks

DOI10.1007/978-3-030-14094-6_2zbMath1522.68078arXiv1710.09280OpenAlexW2963530248MaRDI QIDQ6051497

Christian Scheideler, Jannik Sundermeier, Christina Kolb, Daniel Jung

Publication date: 20 October 2023

Published in: Algorithms for Sensor Systems (Search for Journal in Brave)

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

zbMATH Keywords

convex hullsad hoc networksgreedy routingc-competitiveness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Wireless sensor networks as related to computer science (68M18)

Related Items (1)

Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs

This page was built for publication: Competitive routing in hybrid communication networks