Approximating Additive Distortion of Embeddings into Line Metrics

  • Kedar Dhamdhere
Conference paper

DOI: 10.1007/978-3-540-27821-4_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3122)
Cite this paper as:
Dhamdhere K. (2004) Approximating Additive Distortion of Embeddings into Line Metrics. In: Jansen K., Khanna S., Rolim J.D.P., Ron D. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science, vol 3122. Springer, Berlin, Heidelberg

Abstract

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 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(logn) 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/pn) approximation for the Lp norm of the additive distortion.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Kedar Dhamdhere
    • 1
  1. 1.School of Computer ScienceCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations