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.Expand

We study the speed of convergence on deterministic best-response walks in these games and prove that starting from an arbitrary configuration, after one round of best responses of players, the resulting configuration is a @Q(n)-approximate solution.Expand

We give the first proof of hardness and first non-trivial approximation algorithm for computing Gromov-Hausdorff distance for geodesic metrics in trees.Expand

We show efficient approximation algorithms for greedy permutations in graphs and in high-dimensional Euclidean spaces, and fast exact algorithms for graphs of bounded treewidth.Expand

This article is derived from the emergence of web search and associated technologies, and focuses on the problems of research interest to theoretical computer scientists that arise at Google.Expand