Reductions between expansion problems

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2012, Pages 64-73

  Raghavendra, Prasad ^a   Steurer, David ^b   Tulsiani, Madhur ^c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b MICROSOFT RESEARCH   (United States)

^c TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

Balanced separator; Minimum linear arrangement; Small set expansion; Unique games conjecture

Indexed keywords

ADDITIONAL STRUCTURES; EDGE EXPANSION; EXPANSION PROPERTIES; HARDNESS OF APPROXIMATION; HARDNESS RESULT; MINIMUM LINEAR ARRANGEMENT; SMALL-SET EXPANSIONS; UNIQUE GAMES; UNIQUE GAMES CONJECTURE;

HARDNESS; SEPARATORS;

EXPANSION;

EID: 84866499209     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2012.43     Document Type: Conference Paper

References (26)

1. J. Cheeger, "A lower bound for the smallest eigenvalue of the Laplacian," in Problems in analysis (Papers dedicated to Salomon Bochner, 1969). Princeton, N. J.: Princeton Univ. Press, 1970, pp. 195-199.
2. 1, isoperimetric inequalities for graphs, and superconcentrators," J. Comb. Theory, Ser. B, vol. 38, no. 1, pp. 73-88, 1985.
3. N. Alon, "Eigenvalues and expanders," Combinatorica, vol. 6, no. 2, pp. 83-96, 1986.
4. F. T. Leighton and S. Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms," J. ACM, vol. 46, no. 6, pp. 787-832, 1999.
5. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combinatorica, vol. 15, no. 2, pp. 215-245, 1995.
6. Y. Aumann and Y. Rabani, "An O(log k) approximate min-cut max-flow theorem and approximation algorithm," SIAM J. Comput., vol. 27, no. 1, pp. 291-301, 1998.
7. S. Arora, S. Rao, and U. V. Vazirani, "Expander flows, geometric embeddings and graph partitioning," in STOC, 2004, pp. 222-231.
8. P. Raghavendra, D. Steurer, and P. Tetali, "Approximations for the isoperimetric and spectral profile of graphs and related parameters," in STOC, 2010, pp. 631-640.
9. H. Räcke, "Optimal hierarchical decompositions for congestion minimization in networks," in STOC, 2008, pp. 255-264.
10. N. Bansal, R. Krauthgamer, V. Nagarajan, K. Makarychev, J. S. Naor, and R. Schwartz, "Min-max graph partitioning and small set expansion," 2010, manuscript.
11. P. Raghavendra and D. Steurer, "Graph expansion and the unique games conjecture," in STOC, 2010, pp. 755-764.
12. S. Arora, B. Barak, and D. Steurer, "Subexponential algorithms for unique games and related problems," in FOCS, 2010, pp. 563-572.
13. S. Khot, "On the power of unique 2-prover 1-round games," in STOC, 2002, pp. 767-775.
14. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell, "Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?" SIAM J. Comput., vol. 37, no. 1, pp. 319-357, 2007.
15. S. Khot and O. Regev, "Vertex cover might be hard to approximate to within 2-ε" J. Comput. Syst. Sci., vol. 74, no. 3, pp. 335-349, 2008.
16. 1," in FOCS, 2005, pp. 53-62.
17. P. Raghavendra, "Optimal algorithms and inapproximability results for every CSP?" in STOC, 2008, pp. 245-254.
18. S. Arora, S. Khot, A. Kolla, D. Steurer, M. Tulsiani, and N. K. Vishnoi, "Unique games on expanding constraint graphs are easy," in STOC, 2008, pp. 21-28.
19. U. Feige and C. Scheideler, "Improved bounds for acyclic job shop scheduling," Combinatorica, vol. 22, no. 3, pp. 361-399, 2002.
20. S. Khot and R. Saket, "SDP integrality gaps with local 1- embeddability," in FOCS, 2009.
21. P. Raghavendra and D. Steurer, "Integrality gaps for strong SDP relaxations of unique games," in FOCS, 2009, pp. 575-585.
22. K. Georgiou, A. Magen, T. Pitassi, and I. Tourlakis, "Integrality gaps of 2 - o(1) for vertex cover sdps in the Lovász-Schrijver hierarchy," in FOCS, 2007, pp. 702-712.
23. N. R. Devanur, S. Khot, R. Saket, and N. K. Vishnoi, "Integrality gaps for sparsest cut and minimum linear arrangement problems," in STOC, 2006, pp. 537-546.
24. C. Borell, "Geometric bounds on the Ornstein-Uhlenbeck velocity process," Z. Wahrsch. Verw. Gebiete, vol. 70, no. 1, pp. 1-13, 1985. [Online]. Available: http://dx.doi.org/10.1007/BF00532234
25. P. Raghavendra, D. Steurer, and M. Tulsiani, "Reductions between expansion problems," arXiv:1011.2586, 2010.
26. P. Austrin, T. Pitassi, and Y. Wu, "Inapproximability of treewidth, one-shot pebbling, and related layout problems," arXiv:1109.4910v1, 2011.