Date of Original Version

1-2005

Type

Conference Proceeding

Abstract or Description

We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the two-dimensional plane. Among other results, we give an O(√n)-approximation algorithm for the problem of finding a line embedding of a metric induced by a given unweighted graph, that minimizes the (standard) multiplicative distortion. We give an improved Õ(n1/3) approximation for the case of metrics generated by unweighted trees. This is the first result of this type.

Share

COinS
 

Published In

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 119-128.