Plane embeddings of planar graph metrics

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 197-206

  Bateni, MohammadHossein ^a   Demaine, Erik D ^b   Hajiaghayi, MohammadTaghi ^b   Moharrami, Mohammad ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Euclidean plane; Metric embedding; Planar graphs

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; EMBEDDED SYSTEMS; MOBILE TELECOMMUNICATION SYSTEMS;

EUCLIDEAN PLANE; METRIC EMBEDDING; OUTERPLANAR GRAPH METRICS; PLANAR GRAPHS;

GRAPH THEORY;

EID: 33748069141     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137887     Document Type: Conference Paper

References (29)

1. Robert Babilon, Jirí Matoušek, Jana Maxová, and Pavel Valtr. Low-distortion embeddings of trees. Journal of Graph Algorithms and Applications, 7(4):399-409, 2003.
2. Mihai Bǎdoiu. Approximation algorithm for embedding metrics into a two-dimensional space. In Proceedings of the 14th Annual ACM-SIAM symposium on Discrete Algorithms, pages 434-443, 2003.
3. Mihai Bǎdoiu, Julia Chuzhoy, Piotr Indyk, and Anastasios Sidiropoulos. Low-distortion embeddings of general metrics into the line. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 225-233, 2005.
4. Mihai Bǎdoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, and Piotr Indyk. Low-dimensional embedding with extra information. Discrete & Computational Geometry, to appear.
5. Mihai Bǎdoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, and Anastasios Sidiropoulos. Approximation algorithms for low-distortion embeddings into low-dimensional spaces. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 119-128, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
6. Bonnie Berger, Jon Kleinberg, and Tom Leighton. Reconstructing a three-dimensional model with arbitrary errors. Journal of the ACM, 46(2):212-235, 1999.
7. 1. In Proceedings of the 44th Symposium on Foundations of Computer Science, pages 514-523, October 2003.
8. Srdan Čapkun, Maher Hamdi, and Jean-Pierre Hubaux. GPS-free positioning in mobile ad-hoc networks. In Proceedings of the 34th Hawaii International Conference on System Sciences, pages 3481-3490, January 2001.
9. G. M. Crippen and T. F. Havel. Distance Geometry and Molecular Conformation. John Wiley & Sons, 1988.
10. Anupam Gupta. Embedding tree metrics into low-dimensional euclidean spaces. Discrete & Computational Geometry, 24(1):105-116, 2000.
11. 1-embeddings of graphs. Combinatorica, 24(2):233-269, 2004.
12. J. Håstad, L. Ivansson, and J. Lagergren. Fitting points on the real line and its application to RH mapping. Lecture Notes in Computer Science, 1461:465-467, 1998.
13. B. Hendrickson. The molecule problem: Exploiting structure in global optimization. SIAM Journal on Optimization, 5:835-857, 1995.
14. Piotr Indyk and Jiři Matoušek. Low-distortion embeddings of finite metric spaces. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 8, pages 177-196. CRC Press, second edition, 2004.
15. Robert Krauthgamer, James R. Lee, Manor Mendel, and Assaf Naor. Measured descent: A new embedding method for finite metrics. Geometric and Functional Analysis, 15(4):839-858, 2005.
16. Joseph B. Kruskal. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika, 29:1-27, 1964.
17. Joseph B. Kruskal. Nonmetric multidimensional scaling: A numerical method. Psychometrika, 29:115-129, 1964.
18. 1. Geom. Funct. Anal., 14(4):745-747, 2004.
19. Jiří Matoušek. Bi-Lipschitz embeddings into low-dimensional Euclidean spaces. Commentationes Mathematicae Universitatis Carolinae, 31(3):589-600, 1990.
20. Jiří Matoušek. Lectures on Discrete Geometry, chapter 15. Springer, 2002.
21. 2. In Open Problems from the Workshop on Discrete Metric Spaces and their Algorithmic Applications. Haifa, Israel, March 2002. http://kam.mff.cuni.cz/~matousek/haifaop.ps.
22. Ilan Newman and Yuri Rabinovich. A lower bound on the distortion of embedding planar metrics into Euclidean space. Discrete & Computational Geometry, 29(1):77-81, 2003.
23. Nissanka B. Priyantha, Anit Chakraborty, and Hari Balakrishnan. The Cricket location-support system. In Proceedings of 6th Annual International Conference on Mobile Computing and Networking, pages 32-43, Boston, MA, August 2000.
24. Satish Rao. Small distortion and volume preserving embeddings for planar and euclidean metrics. Proceedings of the 15th Annual ACM Symposium on Computational Geometry, pages 300-306, 1999.
25. C. Savarese, J. Rabaey, and J. Beutel. Locationing in distributed ad-hoc wireless sensor networks. In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, pages 2037-2040, Salt Lake City, UT, May 2001.
26. R. N. Shepard. The analysis of proximities: Multidimensional scaling with an unknown distance function 1. Psychometrika, 27:125-140, 1962.
27. R. N. Shepard. The analysis of proximities: Multidimensional scaling with an unknown distance function 2. Psychometrika, 27:216-246, 1962.
28. Ioannis G. Tollis, Giuseppe Di Battista, Peter Eades, and Roberto Tamassia. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1998.
29. W. T. Tutte. How to draw a graph. Proc. London Math. Soc. (3), 13:743-767, 1963.