Local routing in convex subdivisions

DOI10.1007/978-3-662-46078-8_12MaRDI QIDQ5175100zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid

Publication date 20 February 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46078-8_12

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Local routing in convex subdivisions
• Memoryless routing in convex subdivisions: random walks are optimal
• Improved routing on the Delaunay triangulation
• scientific article; zbMATH DE number 2080234
• ONLINE ROUTING IN CONVEX SUBDIVISIONS

Cited in

(6)

• On local routing of two-terminal nets
• Cone-based spanners of constant degree
• Memoryless routing in convex subdivisions: random walks are optimal
• Local routing in convex subdivisions
• Algorithmic Aspects of Wireless Sensor Networks
• Directional Geometric Routing on Mobile Ad Hoc Networks

This page was built for publication: Local routing in convex subdivisions

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