Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR07-108 | 27th October 2007 00:00

Local Global Tradeoffs in Metric Embeddings

RSS-Feed




TR07-108
Authors: Moses Charikar, Konstantin Makarychev, Yury Makarychev
Publication: 29th October 2007 02:45
Downloads: 1133
Keywords: 


Abstract:

Suppose that every k points in a n point metric space X are D-distortion embeddable into l_1. We give upper and lower bounds on the distortion required to embed the entire space X into l_1. This is a natural mathematical question and is also motivated by the study of relaxations obtained by lift-and-project methods for graph partitioning problems. In this setting, we show that X can be embedded into l_1 with distortion O(D log (n/k)). Moreover, we give a lower bound showing that this result is tight if D is bounded away from 1. For D = 1+delta we give a lower bound of Omega(log (n/k) / log (1/delta)); and for D = 1, we give a lower bound of Omega(log n /(log k + log log n)).
Our bounds significantly improve on the results of Arora, Lovasz, Newman, Rabani, Rabinovich and Vempala, who initiated a study of these questions.



ISSN 1433-8092 | Imprint