Competitive online routing in geometric graphs
From MaRDI portal
Publication:1887089
DOI10.1016/j.tcs.2004.05.019zbMath1073.68059MaRDI QIDQ1887089
Publication date: 23 November 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.019
Delaunay triangulation; Planar graph; Geometric graph; Competitive routing; Good polygon; Greedy triangulation; Minimum weight triangulation; Online routing; Spanner; Spanning ratio
68R10: Graph theory (including graph drawing) in computer science
Related Items
Minimum weight convex Steiner partitions, Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\), Augmenting the connectivity of geometric graphs, Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D, A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS
Cites Work