Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

APPROX
2004
Springer

favoriteEmaildiscussreport

165views Algorithms» more APPROX 2004»

Approximating Additive Distortion of Embeddings into Line Metrics

13 years 9 months ago

Approximating Additive Distortion of Embeddings into Line Metrics

Download www.aladdin.cs.cmu.edu

We consider the problem of ﬁtting 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 distortion is the sum of errors in all pairwise distances in the input data. This problem has been shown to be NP-hard by [13]. We give an O(log n) approximation for this problem by using Garg et al.’s [10] algorithm for the multi-cut problem as a subroutine. Our algorithm also gives an O(log1/p n) approximation for the Lp norm of the additive distortion.

Kedar Dhamdhere

Real-time Traffic

Additive Distortion | Algorithms | APPROX 2004 | Metric Data | Total Additive Distortion |

claim paper

Related Content

» Lowdistortion embeddings of general metrics into the line

» Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar G...

» Embeddings of negativetype metrics and an improved approximation to generalized sparsest c...

» Embedding metrics into ultrametrics and graphs into spanning trees with constant average d...

» Distortion lower bounds for line embeddings

» Embedding ultrametrics into lowdimensional spaces

» Hardness of Embedding Metric Spaces of Equal Size

» A tight bound on approximating arbitrary metrics by tree metrics

» On Euclidean Embeddings and Bandwidth Minimization

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	APPROX
Authors	Kedar Dhamdhere

Comments (0)