Low-dimensional embedding with extra information

Discrete and Computational Geometry

Volumn 36, Issue 4, 2006, Pages 609-632

  Badoiu, Mihai ^a   Demaine, Erik D ^a   Hajiaghayi, Mohammadtaghi ^a   Indyk, Piotr ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750352586     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-1268-5     Document Type: Article

References (29)

1. +] I. Abraham, Y. Bartal, T.-H. H. Chan, K. Dhamdhere, A. Gupta, J. Kleinberg, O. Neiman, and A. Slivkins. Metric embeddings with relaxed guarantees. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 83-100, 2005.
2. +] R. Agarwala, V. Bafna, M. Farach, M. Paterson, and M. Thorup. On the approximability of numerical taxonomy (fitting distances by tree metrics). SIAM Journal on Computing, 28(3):1073-1085, 1999.
3. [B] M. 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.
4. [BCIS] M. Bǎdoiu, J. Chuzhoy, P. Indyk, and A. 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.
5. [BKL] B. Berger, J. Kleinberg, and T. Leighton. Reconstructing a three-dimensional model with arbitrary errors. Journal of the ACM, 46(2):212-235, 1999.
6. [C] R. Connelly. On generic global rigidity. In P. Gritzman and B. Sturmfels, editors, Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, volume 4 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 147-155. AMS Press, Providence, RI, 1991.
7. [CH] G. M. Crippen and T. F. Havel. Distance Geometry and Molecular Conformation. Wiley, New York, 1988.
8. [ČHH] S. Čapkun, M. Hamdi, and J.-P. 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. [CL] C. Coullard and A. Lubiw. Distance visibility graphs. International Journal of Computational Geometry & Applications, 2(4):349-362, 1992.
10. [EHKN] H. Everett, C. T. Hoàng, K. Kilakos, and M. Noy. Distance segment visibility graphs. Manuscript, 1999. http://www.loria.fr/~everett/ publications/distance.html.
11. [FK] M. Farach and S. Kannan. Efficient algorithms for inverting evolution. Journal of the ACM, 46(4):437-449, 1999.
12. [GRK] A. Goel, S. Rai, and B. Krishnamachari. Sharp thresholds for monotone properties in random geometric graphs. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 580-586, 2004.
13. [H1] B. Hendrickson. Conditions for unique graph realizations. SIAM Journal on Computing, 21(1):65-84, February 1992.
14. [H2] B. Hendrickson. The molecule problem: exploiting structure in global optimization. SIAM Journal on Optimization, 5:835-857, 1995.
15. [HIL] J. Håstad, L. Ivansson, and J. Lagergren. Fitting points on the real line and its application to RH mapping. Journal of Algorithms, 49(1):42-62, 2003.
16. [I] L. Ivansson. Computational Aspects of Radiation Hybrid Mapping. Ph.D. thesis, Stockholm, Sweden.
17. [JJ] B. Jackson and T. Jordan. Connected rigidity matroids and unique realizations of graphs. Journal of Combinatorial Theory, Series B, 94(1): 1-29, 2005.
18. [K1] J. B. Kruskal. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika, 29:1-27, 1964.
19. [K2] J. B. Kruskal. Nonmetric multidimensional scaling: a numerical method. Psychometrika, 29:115-129, 1964.
20. [MIT] MIT CSAIL Networks and Mobile Systems group. The Cricket indoor location system. http://nms.csail.mit.edu/projects/cricket/.
21. [PCB] N. B. Priyantha, A. Chakraborty, and H. Balakrishnan. The Cricket location-support system. In Proceedings of the 6th Annual International Conference, on Mobile. Computing and Networking, pages 32-43, Boston, MA, August 2000.
22. [PMBT] N. B. Priyantha, A. K. L. Miu, H. Balakrishnan, and S. Teller. The Cricket compass for context-aware mobile applications. In Proceedings of the 7th ACM International Conference on Mobile Computing and Networking, pages 1-14, Rome, Italy, July 2001.
23. [S1] J. B. Saxe. Embeddability of weighted graphs in k-space is strongly NP-hard. In Proceedings of the 17th Allerton Conference on Communication, Control, and Computing, pages 480-489, 1979.
24. [S2] J. B. Saxe. Two papers on graph embedding problems. Technical Report CMU-CS-80-102, Department of Computer Science, Carnegie-Mellon University, Jan. 1980.
25. [Sh1] R. N. Shepard. The analysis of proximities: multidimensional scaling with an unknown distance function 1. Psychometrika, 27:125-140, 1962.
26. [Sh2] R. N. Shepard. The analysis of proximities: multidimensional scaling with an unknown distance function 2. Psychometrika, 27:216-246, 1962.
27. [SRB] 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.
28. [W] Working Group on Algorithms for Multidimensional Scaling. Algorithms for multidimensional scaling. http://dimacs.rutgers.edu/SpecialYears/2001_Data/ Algorithms/MDSdescription.html.
29. [Y] Y. Yemini. Some theoretical aspects of position-location problems. In Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, pages 1-8, 1979.