Approximation algorithms for semi-random partitioning problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 367-384

  Makarychev, Konstantin ^a   Makarychev, Yury ^b   Vijayaraghavan, Aravindan ^c  

^a IBM RESEARCH   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

approximation algorithm; average case analysis; graph partitioning; random planted model; semi random model

Indexed keywords

AVERAGE-CASE ANALYSIS; BI-CRITERIA; CONSTANT FACTORS; GRAPH PARTITIONING; GRAPH PARTITIONING PROBLEMS; MULTICUTS; OPTIMAL SOLUTIONS; PARTITIONING PROBLEM; RANDOM MODEL; RANDOM PLANTED MODELS; SEMI-RANDOM; SMALL-SET EXPANSIONS; SPARSEST CUT;

COMPUTATION THEORY;

APPROXIMATION ALGORITHMS;

EID: 84862617734     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214013     Document Type: Conference Paper

References (36)

1. A. Agarwal, M. Charikar, K. Makarychev, and Y. Makarychev. O(√log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems. In Proceedings of the thirty-seventh Annual ACM Symposium on Theory of Computing, pages 573-581, 2005.
2. M. Ajtai. Generating hard instances of lattice problems. In Proceedings of the twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 99-108, 1996.
3. M. Ajtai, R. Kumar, and D. Sivakumar. A sieve algorithm for the shortest lattice vector problem. In Proceedings of the thirty-third Annual ACM Symposium on Theory of Computing, pp. 601-610, 2001.
4. N. Alon, M. Krivelevich, and B. Sudakov. Finding a large hidden clique in a random graph. Random Structures & Algorithms, 13(3-4):457-466, 1998.
5. S. Arora, S. A. Khot, A. Kolla, D. Steurer, M. Tulsiani, and N. K. Vishnoi. Unique games on expanding constraint graphs are easy. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 21-28, 2008.
6. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proceedings of the thirty-sixth Annual ACM Symposium on Theory of Computing, pp. 222-231, 2004.
7. M.-F. Balcan, A. Blum, and A. Gupta. Approximate clustering without the approximation. In Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1068-1077, 2009.
8. N. Bansal, U. Feige, R. Krauthgamer, K. Makarychev, V. Nagarajan, J. Naor, and R. Schwartz. Min-max graph partitioning and small set expansion. In Proceedings of 52nd IEEE Symposium on Foundations of Computer Science, pp. 17-26, 2011.
9. A. Bhaskara, M. Charikar, E. Chlamtac, U. Feige, and A. Vijayaraghavan. Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph. In Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 201-210, 2010.
10. Y. Bilu and N. Linial. Are stable instances easy? In ICS'10, pp. 332-341, 2010.
11. A. Blum and J. Spencer. Coloring random and semi-random k-colorable graphs. J. Algorithms, 19:204-234, September 1995.
12. R. B. Boppana. Eigenvalues and graph bisection: An average-case analysis. In 28th Annual Symposium on Foundations of Computer Science, pp. 280-285, 1987.
13. T. N. Bui, F. T. Leighton, S. Chaudhuri, and M. Sipser. Graph bisection algorithms with good average case behavior. Combinatorica, 7:171-191, June 1987.
14. A. Coja-Oghlan. A spectral heuristic for bisecting random graphs. Random Structures & Algorithms, 29(3):351-398, 2006. (Pubitemid 44497230)
15. A. Condon and R. Karp. Algorithms for graph partitioning on the planted partition model. In Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques, volume 1671 of Lecture Notes in Computer Science, pp. 221-232. Springer Berlin / Heidelberg, 1999.
16. T. Dimitriou and R. Impagliazzo. Go with the winners for graph bisection. In Proceedings of the ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 510-520, 1998.
17. M. E. Dyer and A. M. Frieze. Fast solution of some random NP-hard problems. In 27th Annual Symposium on Foundations of Computer Science, pp. 331-336, 1986.
18. U. Feige. Relations between average case complexity and approximation complexity. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 534-543, 2002.
19. U. Feige and J. Kilian. Heuristics for semirandom graph problems. J. Comput. Syst. Sci., 63:639-673, December 2001.
20. U. Feige and R. Krauthgamer. Finding and certifying a large hidden clique in a semirandom graph. Random Struct. Algorithms, 16:195-208, March 2000.
21. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. In Proceedings of the twenty-fifth Annual ACM Symposium on Theory of Computing, pp. 698-707, 1993.
22. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming. J. ACM, 42(6):1115-1145, 1995.
23. V. Guruswami and A. K. Sinop. Lasserre hierarchy, higher eigenvalues, and approximation schemes for quadratic integer programming with PSD objectives. In Proceedings of 52nd IEEE Symposium on Foundations of Computer Science, 2011.
24. M. Jalali, N. Mustapha, A. Mamat, and M. Sulaiman. A new clustering approach based on graph partitioning for navigation patterns mining. In 19th International Conference on Pattern Recognition, pp. 1-4, 2008.
25. M. Jerrum and G. Sorkin. Simulated annealing for graph bisection. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 94-103, 1993.
26. S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the thiry-fourth Annual ACM Symposium on Theory of Computing, pp. 767-775, 2002.
27. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput., 37(1):319-357, 2007. (Pubitemid 351321999)
28. S. Khot and N. K. Vishnoi. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into ℓ1. In 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 53-62, 2005.
29. A. Kolla, K. Makarychev, and Y. Makarychev. How to play unique games against a semi-random adversary. In Proceedings of 52nd IEEE Symposium on Foundations of Computer Science, 2011.
30. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46:787-832, November 1999.
31. K. Makarychev and Y. Makarychev. How to play unique games on expanders. In Approximation and Online Algorithms, volume 6534 of Lecture Notes in Computer Science, pp. 190-200. Springer Berlin / Heidelberg, 2011.
32. F. McSherry. Spectral partitioning of random graphs. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 529-537, 2001.
33. M. Perkowitz and O. Etzioni. Towards adaptive web sites: conceptual framework and case study. Artif. Intell., 118:245-275, April 2000.
34. H. Räcke. Optimal hierarchical decompositions for congestion minimization in networks. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 255-264, 2008.
35. P. Raghavendra. Optimal algorithms and inapproximability results for every CSP? In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 245-254, 2008.
36. P. Raghavendra, D. Steurer, and M. Tulsiani. Reductions between expansion problems. CoRR, abs/1011.2586, 2010.