Abstract
Motivated by applications in combinatorial optimization, we initiate a study of the extent to which the global properties of a metric space (especially, embeddability in ℓ 1 with low distortion) are determined by the properties of small subspaces. We note connections to similar issues studied already in Ramsey theory, complexity theory (especially PCPs), and property testing. We prove both upper bounds and lower bounds on the distortion of embedding locally constrained metrics into various target spaces.
Original language | English |
---|---|
Pages | 41-50 |
Number of pages | 10 |
DOIs | |
State | Published - 2006 |
Externally published | Yes |
Event | Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms - Miami, FL, United States Duration: 22 Jan 2006 → 24 Jan 2006 |
Conference
Conference | Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|
Country/Territory | United States |
City | Miami, FL |
Period | 22/01/06 → 24/01/06 |