Directed metrics and directed graph partitioning problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 51-60

  Charikar, Moses ^a   Makarychev, Konstantin ^a   Makarychev, Yury ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH PARTITIONING PROBLEMS; MATHEMATICAL RELAXATIONS; METRIC EMBEDDING THEORY;

EMBEDDED SYSTEMS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING;

GRAPH THEORY;

EID: 33244474388     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109564     Document Type: Conference Paper

References (18)

1. Amit Agarwal, Moses Charikar, Konstantin Makarychev, and Yury Makarychev, O(√log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems. In Proc. 37th Annual ACM Symposium on Theory of Computing (STOC), pages 573-581, 2005.
2. S. Arora, J. R. Lee, and A. Naor, Euclidean distortion and the sparsest cut. In Proc. 37th STOC, pages 553-562, 2005,
3. S. Arora, S. Rao, and U. Vazirani, Expander flows,geometric embeddings and graph partitioning. In Proc. 36th STOC, pages 222-231, 2004.
4. J. Bourgain, On Lipschitz embedding of finite metric spaces in Hubert space. Israel J. Math., 52:46-52, 1985.
5. S. Chawla, A. Gupta, and H. Räcke, Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. In Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 102-111, 2005.
6. Joseph Cheriyan, Howard Karloff, and Yuval Rabani, Approximating Directed Multicuts. In Proc. 42nd Annual Symposium on Foundations of Computing (FOGS), pages 320-328, 2001.
7. Uriel Feige, Relations between average case complexity and approximation complexity. In Proc. 34th STOC, pages 534-543, 2002.
8. Uriel Feige and Shimon Kogan, Hardness of approximation of the Balanced Complete Bipartite Subgraph problem. Technical Report MCS04-04, Department of Computer Science and Applied Math., Weizmann Institute.
9. P. Frankl and V. Rödl, Forbidden intersections. Trans. Amer. Math. Soc., 300:259-286, 1987.
10. Anupam Gupta, Improved results for directed multicut. In Proc. 14th SODA, pages 454-455, 2003.
11. M. Hajiaghayi and F. Leighton, On the max-flow min-cut ratio for directed multicommodity flows. Tech Report MIT-LCS-TR-910, 2003.
12. Mohammad T. Hajiaghayi and Harald Räcke, An O(√n)- Approximation Algorithm For Directed Sparsest Cut. To appear in IPL.
13. P. Indyk and J. Matousek, Low Distortion Embeddings of Finite Metric Spaces, to appear in Handbook of Discrete and Computational Geometry (2nd edition) J. E. Goodman and J. O'Rourke, editors. CRC Press LLC.
14. 1, To appear in Proc. 46th FOCS, 2005.
15. F. T. Leighton and S. Rao, An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms. In Proc. 29th FOCS, pages 422-431, 1988.
16. N. Linial, E. London and Yu. Rabinovich, The geometry of graphs and some of its algorithmic applications Combinatorica (1995) 15, pp. 215-245
17. J. Matousek. Embedding finite metric spaces into Euclidean spaces, chapter in Lectures on discrete geometry. Graduate Texts in Mathematics, Vol. 212, Springer Verlag, 2002.
18. Paolo Vitolo, The representation of weighted quasimetric spaces. Rend. Istit. Mat. Univ. Trieste 31 (1999), no. 1-2, 95-100.