Pages that link to "Item:Q1887089"
From MaRDI portal
The following pages link to Competitive online routing in geometric graphs (Q1887089):
Displaying 18 items.
- Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations (Q482347) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) (Q621930) (← links)
- Augmenting the connectivity of geometric graphs (Q929747) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Bounding the locality of distributed routing algorithms (Q2375823) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- Efficiently navigating a random Delaunay triangulation (Q2789543) (← links)
- A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS (Q3503105) (← 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)
- Construction and Local Routing for Angle-Monotone Graphs (Q5377357) (← links)
- Constrained routing between non-visible vertices (Q5918146) (← links)
- On the spanning and routing ratio of the directed theta-four graph (Q6124828) (← links)
- Competitive searching over terrains (Q6547937) (← links)
- Routing among convex polygonal obstacles in the plane (Q6610091) (← links)