Pages that link to "Item:Q4818562"
From MaRDI portal
The following pages link to ONLINE ROUTING IN CONVEX SUBDIVISIONS (Q4818562):
Displaying 15 items.
- Memoryless routing in convex subdivisions: random walks are optimal (Q419369) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- On a family of strong geometric spanners that admit local routing strategies (Q551501) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- Competitive online routing in geometric graphs (Q1887089) (← links)
- Local routing in a tree metric \(1\)-spanner (Q2084633) (← links)
- Bounding the locality of distributed routing algorithms (Q2375823) (← links)
- Efficiently navigating a random Delaunay triangulation (Q2789543) (← links)
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755) (← links)
- Competitive Online Routing on Delaunay Triangulations (Q4605336) (← links)
- Competitive Searching for a Line on a Line Arrangement. (Q5091041) (← links)
- Local Routing in Convex Subdivisions (Q5149568) (← links)
- On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks (Q5445787) (← links)
- (Q5743479) (← links)
- Routing on heavy path WSPD spanners (Q6600811) (← links)
