O(√log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and Directed Cut problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 573-581

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

^a Princeton University   (United States)

Author keywords

Directed Balanced Separator; Directed Sparsest Cut; Min 2CNF Deletion; Min Multicut; Min UnCut

Indexed keywords

DIRECTED BALANCED SEPARATOR; DIRECTED SPARSEST CUT; MIN 2CNF DELETION; MIN MULTICUT; MIN UNCUT;

APPROXIMATION THEORY; IMAGE ANALYSIS; PROBLEM SOLVING;

ALGORITHMS;

EID: 34848857660     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060675     Document Type: Conference Paper

References (19)

1. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci., 54(2):317-331, 1997.
2. S. Arora, J. R. Lee, and A. Naor. Euclidean distortion and the sparsest cut. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), 2005.
3. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pages 222-231, 2004.
4. B. Bollobas. Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Probabilistic Combinatorics, pages 122-130. 1986.
5. M. Charikar, H. Karloff, and S. Rao. Improved approximation algorithms for vertex ordering problems. In manuscript, 2004.
6. 1. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
7. M. Chlebík and J. Chlebíková. On approximation hardness of the minimum 2sat-deletion problem. In Proceedings of 29th International Symposium on Mathematical Foundations of Computer Science, pages 263-273, 2004.
8. P. Frankl and V. Rödl. Forbidden intersections. Trans. Amer. Math. Soc., 300:259-286, 1987.
9. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC), pages 698-707, 1993.
10. S. Hart. A note on the edges of the n-cube. Discrete Mathematics, 14:157-163, 1976.
11. G. Karakostas. A better approximation ratio for the vertex cover problem. In Electronic Colloquium on Computational Complexity Report TR04-084, 2004.
12. S. Khanna, M. Sudan, L. Trevisan, and D. P. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6):1863-1920, 2001.
13. S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 767-775, 2002.
14. P. Klein, S. Plotkin, S. Rao, and E. Tardos. Approximation algorithms for steiner and directed multicuts. Journal of Algorithms, 22:241-269, 1997.
15. D. G. Larman and C. A. Rogers. Realization of distances within sets in euclidean space. Mathematika, 19:1-24, 1972.
16. J. R. Lee. On distance scales, embeddings, and efficient relaxations of the cut cone. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
17. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
18. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Computer and System Sciences, 43:425-440, 1991.
19. B. Yu, J. Cheriyan, and P. E. Maxell. Hypercubes and multicommodity flows. SIAM Journal on Discrete Mathematics, 10(2):190-200, 1997.