1. Andoni, A., Deza, M., Gupta, A., Indyk, P., Raskhodnikova, S.: Lower bounds for embedding edit distance into normed spaces. In: SODA '03: Proceedings of the fourteenth annual ACM-SIAM Symposium on Discrete Algorithms, pp 523–526. Society for Industrial and Applied Mathematics, 2003
2. Archer, A., Fakcharoenphol, J., Harrelson, C., Krauthgamer, R., Talwar, K., Tardos, E.: Approximate classification via earthmover metrics. In: SODA '04: Proceedings of the fifteenth annual ACM-SIAM Symposium on Discrete Algorithms, pp 1079–1087. Society for Industrial and Applied Mathematics, 2004
3. Aumann, Y., Rabani, Y.: An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput. 27(1), 291–301 (electronic), (1998)
4. Ball, K., Carlen, E.A., Lieb, E.H.: Sharp uniform convexity and smoothness inequalities for trace norms. Invent. Math. 115(3), 463–482 (1994)
5. Bar-Yossef, Z., Jayram, T.S., Krauthgamer, R., Kumar, R.: Approximating edit distance efficiently. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp 550–559. IEEE, Oct. 2004