Author:
Indyk Piotr,Magen Avner,Sidiropoulos Anastasios,Zouzias Anastasios
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Andoni, A., Onak, K.: Approximating Edit Distance in Near-Linear Time. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 199–204 (2009)
2. Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS), pp. 184–193 (1996)
3. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 161–168 (1998)
4. Bourgain, J.: On Lipschitz Embedding of Finite Metric Spaces in Hilbert space. Israel J. Math. 52(1-2), 46–52 (1985)
5. Calinescu, G., Karloff, H., Rabani, Y.: Approximation Algorithms for the 0-extension Problem. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 8–16 (2001)