volume 31, issue 3, P339-356 2004
DOI: 10.1007/s00454-003-2872-2
View full text
|
|
Share

Abstract: AbstractMetric spaces and their embeddings have recently played a prominent role in the development of new algorithms. So far, most of the emphasis was on embeddings that preserve pairwise distances. A very intriguing concept introduced by Feige [Fei00], allows us to quantify the extent to which higher-dimensional structures are preserved by a given embedding. We investigate this concept for several basic graph families such as paths, trees, cubes and expanders.

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

1
12
0

Publication Types

Select...

Relationship

0
0

Authors

Journals