Competitive Online Routing in Geometric Graphs

Competitive Online Routing in Geometric Graphs (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Prosenjit Bose , Pat Morin

Venue:	Theoretical Computer Science
Citations:	27 - 4 self

BibTeX

@TECHREPORT{Bose01competitiveonline,
    author = {Prosenjit Bose and Pat Morin},
    title = {Competitive Online Routing in Geometric Graphs},
    institution = {Theoretical Computer Science},
    year = {2001}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We consider online routing algorithms for finding paths between the vertices of plane graphs.

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
1567	Randomized Algorithms - Motwani, Raghavan - 1995
1311	Distributed Algorithms - Lynch - 1996
1248	GPSR: greedy perimeter stateless routing for wireless networks - Karp, Kung - 2000
1206	Introduction to Parallel Algorithms and Architectures: Arrays - Leighton - 1992
985	Graph Theory with Applications - Bondy, Murty - 1976
565	Location-Aided Routing (LAR) in Mobile Ad Hoc Networks, Research reported is supported in part by Texas Advanced Technology Programgrants 010115-248 and 009741-052-C - Young-BaeKo, Vaidya
549	R.: Online Computation and Competitive Analysis - Borodin, El-Yaniv - 1998
509	Routing with guaranteed delivery in ad hoc wireless networks - Bose, Morin, et al.
476	Concrete Mathematics - Graham, Knuth, et al. - 1989
353	Spatial tessellations: Concepts and Applications of Voronoi diagrams - Okabe, Boots, et al. - 2000
305	Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals - Takagi, Kleinrock
294	Lectures on Polytopes - Ziegler - 1995
210	A New Statistical Approach to Geographic Variation Analysis. Systematic Zoology - Gabriel, Sokal - 1969
209	Compass Routing On Geometric Networks - Kranakis, Singh, et al. - 1999
168	Embedding planar graphs on the grid - Schnyder - 1990
147	Optimal point location in a monotone subdivision - Edelsbrunner, Guibas, et al. - 1986
146	K: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput Geom - Avis, Fukuda - 1992
139	Transmission Range Control in Multihop Packet Radio Networks - Hou, Li
127	Shortest paths without a map - Papadimitriou, Yannakakis - 1991
123	Geocasting in mobile ad-hoc networks: Location-based multicast algorithms - Ko, Vaidya - 1999
106	Searching in the plane - Baeza-Yates, Culberson, et al. - 1993
104	Preparata and Michael Ian Shamos. Computational Geometry: An Introduction - Franco - 1985
96	Delaunay graphs are almost as good as complete graphs - Dobkin, Friedman, et al. - 1990
83	Online routing in triangulations - Bose, Morin - 2004
76	Convex representation of graphs - Tutte - 1960
54	Which triangulations approximate the complete graph - Das, Joseph - 1989
48	Walking an unknown street with bounded detour - Klein - 1992
46	Properties of Gabriel graphs relevant to geographic variation research and clustering of points in the plane - Matula, Sokal - 1980
41	Efficient message routing in planar networks - Frederickson, Janardan - 1989
41	GEDIR: Loop-free location based routing in wireless networks - Stojmenovic, Lin - 1999
41	The spatial capacity of a slotted aloha multihop packet radio network with capture - Nelson, Kleinrock - 1984
40	Small sets supporting fary embeddings of planar graphs - Fraysseix, Pach, et al. - 1988
33	A.: Online routing in convex subdivisions - Bose, Morin, et al. - 2000
29	Compact routing tables for graphs of bounded genus - GAVOILLE, HANUSSE - 1999
28	Convex drawings of graphs in two and three dimensions - Chrobak, Goodrich, et al. - 1996
28	An acyclicity theorem for cell complexes in d dimensions - Edelsbrunner - 1990
28	Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain - Gold, Charters, et al. - 1977
25	Searching for the kernel of a polygon: A competitive strategy - Icking, Klein - 1995
25	Algorithmische Geometrie - Klein - 1997
23	Simple traversal of a subdivision without extra storage - Berg, Kreveld, et al. - 1997
22	A competitive strategy for learning a polygon - Homan, Icking, et al. - 1997
22	Y.: Optimal constructions of hybrid algorithms - Kao, Ma, et al. - 1998
19	A distance routing eect algorithm for mobility (DREAM - Basagni, Chlamtac, et al. - 1998
19	Spatially ordered networks and topographic reconstructions - Gold, Cormack - 1987
18	Going Home Through and Unknown Street - L'opez-Ortiz, Schuierer - 1994
16	Intersections with random geometric objects - Bose, Devroye - 1995
16	Generalized streets revisited - L'opez-Ortiz, Schuierer - 1996
15	Computer networks with compact routing tables - Leeuwen, Tan - 1986
13	Position-independent near optimal searching and on-line recognition in star polygons - L'opez-Ortiz, Schuierer - 1997