Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut

ACM Transactions on Algorithms

Volumn 4, Issue 2, 2008, Pages

  Chawla, Shuchi ^a   Gupta, Anupam ^b,d   Räcke, Harald ^c  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF WARWICK   (United Kingdom)

^d Carnegie Mellon University ^*  (United States)

Author keywords

Approximation algorithm; Embedding; Metrics; Negative type metric; Sparsest cut

Indexed keywords

EMBEDDINGS; EUCLIDEAN METRIC; METRICS (CO);

EID: 44849139807     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1361192.1361199     Document Type: Article

References (35)

1. ARORA, S., LEE, J., AND NAOR, A. 2005. Euclidean distortion and the sparsest cut. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC). ACM Press, New York, NY, 553-562.
2. ARORA, S., RAO, S., AND VAZIRANI, U. 2004. Expander flows, geometric embeddings, and graph par-titionings. In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC). ACM Press, New York, NY, 222-231.
3. AUMANN, Y. AND RABANI, Y. 1998. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput. 27, 1, 291-301.
4. BARTAL, Y. 1998. On approximating arbitrary metrics by tree metrics. In Proceedings of the 30th ACM Symposium on Theory of Computing (STOC). ACM Press, New York, NY, 161-168.
5. BOURGAIN, J. 1985. On Lipschitz embeddings of finite metric spaces in Hilbert space. Israel J. Math. 52, 1-2, 46-52.
6. CǍLINESCU, G., KARLOFF, H. J., AND RABANI, Y. 2004. Approximation algorithms for the 0-extension problem. SIAM J. Comput. 34, 2, 358-372.
7. CHAWLA, S., KRAUTHGAMER, R., KUMAR, R., RABANI, Y., AND SIVAKUMAR, D. 2006. On the hardness of approximating sparsest cut and multicut. Computat. Complex. 15, 2, 94-114.
8. 1. SIAM J. Discrete Math. 20, 1, 119-136.
9. CLARKSON, K. L. 1995. Las Vegas algorithms for linear and integer programming when the dimension is small. J. ACM 42, 2, 488-499.
10. DEZA, M. M. AND LAURENT, M. 1997. Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol. 15. Springer-Verlag, Berlin, Germany.
11. P-spaces. Arkiv För Matematik 8, 103-105.
12. FAKCHAROENPHOL, J., RAO, S., AND TALWAR, K. 2004. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69, 3, 485-497.
13. GOEMANS, M. X. 1997. Semidefinite programming and combinatorial optimization. Math. Program. 49, 143-161.
14. GUPTA, A., Krauthgamer, R., and Lee, J. R. 2003. Bounded geometries, fractals, and low-distortion embeddings. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 534-543.
15. 1-embeddings of graphs. Combinatorica 24, 2, 233-269.
16. INDYK, P. 2001. Algorithmic aspects of geometric embeddings. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 10-33.
17. KARZANOV, A. V. 1985. Metrics and undirected cuts. Math. Program. 32, 2, 183-198.
18. KHOT, S. 2002. On the power of unique 2-prover 1-round games. In Proceedings of the 34th ACM Symposium on Theory of Computing (STOC). ACM Press, New York, NY, 767-775.
19. 1. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 53-62.
20. KRAUTHGAMER, R., LEE, J., MENDEL, M., AND NAOR, A. 2005. Measured descent: A new embedding method for finite metrics. Geom. Funct. Anal. 15, 4, 839-858.
21. 1. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM Press, New York, NY, 1010-1017.
22. LEE, J. R. 2005. On distance scales, embeddings, and efficient relaxations of the cut cone. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM Press, New York, NY, 92-101.
23. LEE, J. R. AND NAOR, A. 2005. Extending lipschitz functions via random metric partitions. Inventiones Mathematicae 160, 1, 59-95.
24. LEIGHTON, F. T. AND RAO, S. B. 1999. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46, 6, 787-832.
25. LINIAL, N. 2002. Finite metric-spaces - combinatorics, geometry and algorithms. In Proceedings of the International Congress of Mathematicians Vol. III. Higher Education Press, Beijing, China, 573-586.
26. LINIAL, N, LONDON, E., AND RABINOVICH, Y 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 2, 215-245.
27. LITTLESTONE, N. AND WARMUTH, M. K. 1994. The weighted majority algorithm. Inform. Comput. 108, 2, 212-261.
28. MATOUŠEK, J. 1999. On embedding trees into uniformly convex Banach spaces. Israel J. Math. 114, 221-237.
29. MATOUŠEK, J. 2002. Lectures on discrete geometry. Graduate Texts in Mathematics, vol. 212. Springer, Berlin, Germany.
30. MATOUŠEK, J. 1996. On the distortion required for embedding finite metric spaces into normed spaces. Israel J. Math. 93, 333-344.
31. 1. In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC). ACM Press, New York, NY, 456-462.
32. RAO, S. B. 1999. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the 15th ACM Symposium on Computational Geometry. ACM Press, New York, NY, 300-306.
33. SHAHROKHI, F. AND MATULA, D. W. 1990. The maximum concurrent flow problem. J. ACM 37, 2, 318-334.
34. SHMOYS, D. B. 1997. Cut problems and their application to divide-and-conquer. In Approximation Algorithms for NP-hard Problems, D. S. Hochbaum, Ed. PWS Publishing, Boston, MA, 192-235.
35. WELZL, E. 1996. Suchen und Konstruieren durch Verdoppeln. In Highlights der Informatik, I. Wegener, Ed. Springer, Berlin, Germany, 221-228.