Some results on greedy embeddings in metric spaces

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 337-346

  Leighton, Tom ^a   Moitra, Ankur ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED GRAPHS; EMBEDDINGS; EUCLIDEAN PLANES; METRIC SPACES; OF GRAPHS; POINT LOCATIONS; VIRTUAL COORDINATES;

COMPUTATIONAL GEOMETRY; COMPUTER NETWORKS; COMPUTERS; FIBER OPTIC CHEMICAL SENSORS; ROUTING PROTOCOLS; SET THEORY; TOPOLOGY; WIRELESS SENSOR NETWORKS;

ROUTING ALGORITHMS;

EID: 57949102978     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.18     Document Type: Conference Paper

References (14)

1. D. Barnette. Trees in polyhedral graphs. Canada J. Math, 18:73.1-736, .1966.
2. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7:609-616, 2001.
3. R. Dhandapani. Greedy drawings of triangulations. Symposium on Discrete Algorithms, pages 102-111, 2008.
4. A. Frieze, J. Kleinberg, R. Ravi, and W. Debany. Line-of-sight networks. Symposium on Discrete Algorithms, pages 968-977, 2007.
5. Z. Gao. 2-connected coverings of bounded degree in 3-connected graphs. J. Graph Theory, 20:327-338, 1995.
6. Z. Gao and R. Richter. 2-walks in circuit graphs. J. Comb. Theory Series B, 62:259-267, 1994.
7. A. Goel, S. Rai, and B. Krishnamachari. Sharp thresholds for monotone properties in random geometric graphs. ACM Symposium on Theory of Computing, pages 580-586, 2004.
8. B. Karp and H. T. Kung. Gpsr: Greedy perimeter stateless routing for wireless networks. Proceedings of the 6th annual International Conference on Mobile Computing and Networking, pages 243-254, 2000.
9. R. Kleinberg. Geographic routing in hyperbolic space. INFOCOM 2007, 26th IEEE Conference on Computer Communications, pages 1902-1909, 2007.
10. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zolliger. Geometric ad-hoc routing: Of theory and practice. Annual ACM Symposium on Principles of Distributed Computing, pages 63-72, 2003.
11. C. Papadimitriou and D. Ratajczak. On a conjecture related to geometric routing. Theoretical Computer Science, 244:3-14, 2005.
12. M. Penrose. Random Geometric Graphs in Oxford Studies in Probability, volume 5. Oxford University Press, 2003.
13. A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica. Geographic routing without location information. Proceedings of the 9th annual International Conference on Mobile Computing and Networking, pages 96-108, 2003.
14. C. Thomassen. A theorem on paths in planar graphs. J. Graph Theory, 7:169-176, 1983.