Local Embeddings of Metric Spaces

被引:1
作者
Abraham, Ittai [1 ]
Bartal, Yair [2 ]
Neiman, Ofer [3 ]
机构
[1] Microsoft Res SVC, Mountain View, CA USA
[2] Hebrew Univ Jerusalem, Jerusalem, Israel
[3] Ben Gurion Univ Negev, IL-84105 Beer Sheva, Israel
关键词
Metric embedding; Algorithms; Graph theory; APPROXIMATION;
D O I
10.1007/s00453-013-9864-2
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In many application areas, complex data sets are often represented by some metric space and metric embedding is used to provide a more structured representation of the data. In many of these applications much greater emphasis is put on preserving the local structure of the original space than on maintaining its complete structure. This is also the case in some networking applications where "small world" phenomena in communication patterns have been observed. Practical study of embedding has indeed involved with finding embeddings with this property. In this paper we initiate the study of local embeddings of metric spaces and provide embeddings with distortion depending solely on the local structure of the space.
引用
收藏
页码:539 / 606
页数:68
相关论文
共 51 条
[1]   Metric embeddings with relaxed guarantees [J].
Abraham, I ;
Bartal, Y ;
Chan, THH ;
Dhamdhere, K ;
Gupta, A ;
Kleinberg, J ;
Neiman, O ;
Slivkins, A .
46TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2005, :83-100
[2]  
Abraham I., 2006, STOC'06. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, P271, DOI 10.1145/1132516.1132557
[3]  
Abraham I, 2009, PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P875
[4]  
Abraham I, 2008, PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P363
[5]   Local Embeddings of Metric Spaces [J].
Abraham, Ittai ;
Bartal, Yair ;
Neiman, Ofer .
STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, :631-640
[6]   Nearly Tight Low Stretch Spanning Trees [J].
Abraham, Ittai ;
Bartal, Yair ;
Neiman, Ofer .
PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, :781-790
[7]  
Abraham I, 2007, PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P502
[8]   Problems and results in extremal combinatorics - I [J].
Alon, N .
DISCRETE MATHEMATICS, 2003, 273 (1-3) :31-53
[9]   A GRAPH-THEORETIC GAME, AND ITS APPLICATION TO THE K-SERVER PROBLEM [J].
ALON, N ;
KARP, RM ;
PELEG, D ;
WEST, D .
SIAM JOURNAL ON COMPUTING, 1995, 24 (01) :78-100
[10]  
[Anonymous], 1997, P 20 9 ANN ACM S THE, DOI DOI 10.1145/258533.258667