Sciweavers

31 search results - page 1 / 7
» Approximating Additive Distortion of Embeddings into Line Me...
Sort
View
APPROX
2004
Springer
165views Algorithms» more  APPROX 2004»
13 years 10 months ago
Approximating Additive Distortion of Embeddings into Line Metrics
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
Kedar Dhamdhere
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 5 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
APPROX
2010
Springer
220views Algorithms» more  APPROX 2010»
13 years 6 months ago
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri...
TALG
2008
86views more  TALG 2008»
13 years 4 months ago
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
In this paper, we study the metrics of negative type, which are metrics (V, d) such that d is an Euclidean metric; these metrics are thus also known as " 2-squared" met...
Shuchi Chawla, Anupam Gupta, Harald Räcke
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
13 years 6 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman