11 citations · 66 across the 33 of their papers we have counts for
4 papers · 1 filter
Computing the Gromov-Hausdorff Distance for Metric Trees
Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath +2
The Gromov-Hausdorff (GH) distance is a natural way to measure distance between two metric spaces. We prove that it is -hard to approximate the Gromov-Hausdorff distan…
Metric embedding with outliers
Anastasios Sidiropoulos, Yusu Wang
We initiate the study of metric embeddings with \emph{outliers}. Given some metric space we wish to find a small set of outlier points and either an isometric…
Approximate Greedy Clustering and Distance Selection for Graph Metrics
David Eppstein, Sariel Har-Peled, Anastasios Sidiropoulos
In this paper, we consider two important problems defined on finite metric spaces, and provide efficient new algorithms and approximation schemes f…
Layouts of Expander Graphs
Vida Dujmović, Anastasios Sidiropoulos, David R. Wood
Bourgain and Yehudayoff recently constructed -monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-…