Abstract
The extensive study of metric spaces and their embeddings has so far focused on embeddings that preserve pairwise distances. A very intriguing concept introduced by Feige [F] allows us to quantify the extent to which larger structures are preserved by a given embedding. We investigate this concept, focusing on several major graph families such as paths, trees, cubes, and expanders. We find some similarities to the regular (pairwise) distortion, as well as some striking differences.
Original language | American English |
---|---|
Pages (from-to) | 339-356 |
Number of pages | 18 |
Journal | Discrete and Computational Geometry |
Volume | 31 |
Issue number | 3 |
DOIs | |
State | Published - Apr 2004 |