Competitive online routing in geometric graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4155925 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1947396 (Why is no real title available?)
- scientific article; zbMATH DE number 758742 (Why is no real title available?)
- Constructing competitive tours from local information
- Delaunay graphs are almost as good as complete graphs
- ONLINE ROUTING IN CONVEX SUBDIVISIONS
- Online Routing in Triangulations
- Searching in the plane
- Shortest paths without a map
Cited in
(20)- Local routing in convex subdivisions
- Routing among convex polygonal obstacles in the plane
- Routing in polygonal domains
- ONLINE ROUTING IN CONVEX SUBDIVISIONS
- Competitive Searching for a Line on a Line Arrangement.
- scientific article; zbMATH DE number 1522924 (Why is no real title available?)
- Minimum weight convex Steiner partitions
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS
- scientific article; zbMATH DE number 2080234 (Why is no real title available?)
- Competitive online routing on Delaunay triangulations
- Routing among convex polygonal obstacles in the plane
- Augmenting the connectivity of geometric graphs
- Competitive online routing on Delaunay triangulations
- Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
- Construction and Local Routing for Angle-Monotone Graphs
- On the spanning and routing ratio of the directed theta-four graph
- Competitive searching over terrains
- Bounding the locality of distributed routing algorithms
This page was built for publication: Competitive online routing in geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887089)
