Competitive online routing in geometric graphs

Theoretical Computer Science

Volumn 324, Issue 2-3 SPEC. ISS., 2004, Pages 273-288

  Bose, Prosenjit ^a   Morin, Pat ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Competitive routing; Delaunay triangulation; Geometric graph; Good polygon; Greedy triangulation; Minimum weight triangulation; Online routing; Planar graph; Spanner; Spanning ratio

Indexed keywords

COMPETITIVE ROUTING; DELAUNAY TRIANGULATION; GEOMETRIC GRAPH; GOOD POLYGON; GREEDY TRIANGULATION; MINIMUM WEIGHT TRIANGULATION; ONLINE ROUTING; PLANAR GRAPH; SPANNER; SPANNING RATIO;

ALGORITHMS; GRAPH THEORY; INFORMATION ANALYSIS; ONLINE SYSTEMS; SET THEORY; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

ROUTERS;

EID: 4444275684     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.05.019     Document Type: Article

References (14)

1. Baeza-Yates R., Culberson J., Rawlins G. Searching in the plane. Inform. and Comput. 106(2):1993;234-252.
2. M. Ball, T. Magnanti, C. Monma, G. Nemhauser (Eds.), Network Routing, North-Holland, Amsterdam, 1995.
3. Borodin A., El-Yaniv R. Online Computation and Competitive Analysis. 1998;Cambridge University Press, Cambridge.
4. Bose P., Brodnik A., Carlsson S., Demaine E., Fleischer R., Lopez A., Morin P., Munro I. Online routing in convex subdivisions. Internat. J. Comput. Geom. 12(4):2002;283-295. See also Proc. 11th Internat. Symp. Algorithms and Computation (ISAAC'00), Lecture Notes in Computer Science, Springer, Berlin, 2000, pp. 57-79.
5. Bose P., Brodnik A., Carlsson S., Demaine E., Fleischer R., Lopez A., Morin P., Munro I. Online routing in convex subdivisions. Internat. J. Comput. Geom. 12(4):2002;283-295. See also Proc. 11th Internat. Symp. Algorithms and Computation (ISAAC'00), Lecture Notes in Computer Science, Springer, Berlin, 2000, pp. 57-79.
6. P. Bose, J. Gudmundsson, M. Smid, Constructing plane spanners of bounded degree, in: Proc. European Symp. on Algorithms (ESA'02), Lecture Notes in Computer Science, Springer, Berlin, 2002, pp. 234-246.
7. Bose P., Morin P. Online routing in triangulations. SIAM J. Comput. 33:2004;937-951.
8. Cucka P., Netanyahu N.S., Rosenfeld A. Learning in navigation. goal finding in graphs Internat. J. Pattern Recognition Artif. Intell. 10(5):1996;429-446.
9. G. Das, D. Joseph, Which triangulations approximate the complete graph? in: Proc. Internat. Symp. Optimal Algorithms, 1989, pp. 168-192.
10. Dobkin D., Friedman S.J., Supowit K.J. Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom. 5:1990;399-407. See also 28th Symp. Found. Comp. Sci., 1987, pp. 20-26.
11. Dobkin D., Friedman S.J., Supowit K.J. Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom. 5:1990;399-407. See also 28th Symp. Found. Comp. Sci., 1987, pp. 20-26.
12. Kalyanasundaram B., Pruhs K.R. Constructing competitive tours from local information. Theoret. Comput. Sci. 130:1994;125-138.
13. E. Kranakis, H. Singh, J. Urrutia, Compass routing on geometric networks, in: Proc. of the 11th Canadian Conf. on Computational Geometry (CCCG'99), 1999.
14. Papadimitriou C.H., Yannakakis M. Shortest paths without a map. Theoret. Comput. Sci. 84:1991;127-150.