ACM Home Page
Please provide us with feedback. Feedback
Approximation algorithm for embedding metrics into a two-dimensional space
Full text PdfPdf (818 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms table of contents
Baltimore, Maryland
SESSION: Session 7A table of contents
Pages: 434 - 443  
Year of Publication: 2003
ISBN:0-89871-538-5
Author
Mihai Bâdoiu  MIT Laboratory for Computer Science, Cambridge, Massachusetts
Sponsors
: SIAM Activity Group on Discrete Mathematics
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 33,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

In this paper, we present a polynomial-time approximation algorithm for computing an embedding of an arbitrary metric into a two-dimensional space. The algorithm finds an embedding whose additive distortion is at most cε*, where ε* is the smallest additive distortion possible and c is an absolute constant. To our knowledge, this is the first result of this type, i.e., it gives an algorithm that finds (approximately) optimal embedding of a given distance matrix into a fixed d-dimensional space, where d < 1 is low, under any standard definition of embedding (see Related Work).


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
{Bou85} J. Bourgain. On lipschitz embedding of finite metric spaces into hilbert space. Isreal Journal of Mathematics, 52:46--52, 1985.
3
 
4
 
5
 
6
{Iva00} L. Ivansson. Computational aspects of radiation hybrid. Doctoral Dissertation, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, 2000.
 
7
{Kru64a} J.B. Kruskal. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika, 29:1--27, 1964.
 
8
{Kru64b} J.B. Kruskal. Nonmetric multidimensional scaling: A numerical method. Psychometrika, 29:115--129, 1964.
 
9
{Mat90} J. Matoušek. Bi-lipschitz embeddings into low-dimensional euclidean spaces. Comment. Math. Univ. Carolinae, 31:589--600, 1990.
 
10
{Mat02} J. Matoušek. Lectures in Discrete Geometry. Springer-Verlag, 2002.
 
11
{MDS} Algorithms for multidimensional scaling. http://dimacs.rutgers.edu/Special Years/200l_Data/Algorithms/MDSdescription.html.
 
12
{She62a} R. N. Shepard. The analysis of proximities: Multidimensional scaling with an unknown distance function 1. Psychometrika, 27:125--140, 1962.
 
13
{She62b} R. N. Shepard. The analysis of proximities: Multidimensional scaling with an unknown distance function 2. Psychometrika, 27:216--246, 1962.

CITED BY  9