Computational geometry: an introduction
Computational geometry: an introduction
Theoretical Computer Science
Constructing competitive tours from local information
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Online computation and competitive analysis
Online computation and competitive analysis
Online Routing in Triangulations
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
Hi-index | 0.00 |
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm under the link distance metric even when the input graph is restricted to be a Delaunay, greedy, or minimum-weight triangulation.