1. Agarwal A, Charikar M, Makarychev K, Makarychev Y (2005) O(vlog n) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems. In: Proceedings of the 37th ACM symposium on theory of computing (STOC), Baltimore, pp 573–581
2. Aggarwal A, Alon N, Charikar M (2007) Improved approximations for directed cut problems. In: Proceedings of the 39th ACM symposium on theory of computing (STOC), San Diego, pp 671–680
3. Arora S, Satish R, Vazirani U (2004) Expander flows, geometric embeddings, and graph partitionings. In: Proceedings of the 36th ACM symposium on theory of computing (STOC), Chicago, pp 222–231
4. Chawla S, Krauthgamer R, Kumar R, Rabani Y, Sivakumar D (2005) On the hardness of approximating sparsest cut and multicut. In: Proceedings of the 20th IEEE conference on computational complexity (CCC), San Jose, pp 144–153
5. Chuzhoy J, Khanna S (2007) Polynomial flow-cut gaps and hardness of directed cut problems. In: Proceedings of the 39th ACM symposium on theory of computing (STOC), San Diego, pp 179–188