Abstract
Kolla and Tulsiani [KT07, Kol11] and Arora, Barak and Steurer [ABS10] introduced the technique of subspace enumeration, which gives approximation algorithms for graph problems such as unique games and small set expansion; the running time of such algorithms is exponential in the threshold-rank of the graph.
Guruswami and Sinop [GS11, GS12], and Barak, Raghavendra, and Steurer [BRS11] developed an alternative approach to the design of approximation algorithms for graphs of bounded threshold-rank, based on semidefinite programming relaxations in the Lassere hierarchy and on novel rounding techniques. These algorithms are faster than the ones based on subspace enumeration and work on a broad class of problems.
In this paper we develop a third approach to the design of such algorithms. We show, constructively, that graphs of bounded threshold-rank satisfy a weak Szemeredi regularity lemma analogous to the one proved by Frieze and Kannan [FK99] for dense graphs. The existence of efficient approximation algorithms is then a consequence of the regularity lemma, as shown by Frieze and Kannan.
Applying our method to the Max Cut problem, we devise an algorithm that is faster than all previous algorithms, and is easier to describe and analyze.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Barak, B., Steurer, D.: Subexponential algorithms for unique games and related problems. In: FOCS, pp. 563–572 (2010)
Alon, N., Naor, A.: Approximating the cut-norm via grothendieck’s inequality. SIAM J. Comput. 35(4), 787–803 (2006)
Barak, B., Raghavendra, P., Steurer, D.: Rounding semidefinite programming hierarchies via global correlation. In: FOCS, pp. 472–481 (2011)
Coja-Oghlan, A., Cooper, C., Frieze, A.: An efficient sparse regularity concept. In: SODA, pp. 207–216. Society for Industrial and Applied Mathematics, Philadelphia (2009)
Fernandez De la Vega, W., Karpinski, M., Kannan, R., Vempala, S.: Tensor decomposition and approximation schemes for constraint satisfaction problems. In: STOC, pp. 747–754. ACM, New York (2005)
Frieze, A.M., Kannan, R.: The regularity lemma and approximation schemes for dense problems. In: FOCS, p. 12. IEEE Computer Society, Washington, DC (1996)
Frieze, A.M., Kannan, R.: Quick approximation to matrices and applications. Combinatorica 19(2), 175–220 (1999)
Guruswami, V., Sinop, A.K.: Lasserre hierarchy, higher eigenvalues, and approximation schemes for graph partitioning and quadratic integer programming with psd objectives. In: FOCS, pp. 482–491 (2011)
Guruswami, V., Sinop, A.K.: Faster sdp hierarchy solvers for local rounding algorithms. In: FOCS (2012)
Guruswami, V., Sinop, A.K.: Lasserre sdps, l1-embeddings, and approximating non-uniform sparsest cut via generalized spectra. In: SODA (2013)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115–1145 (1995)
Kolla, A.: Spectral algorithms for unique games. Comput. Complex. 20(2), 177–206 (2011)
Kolla, A., Tulsiani, M.: Playing unique games using graph spectra. Manuscript (2007)
Szemeredi, E.: Regular partitions of graphs. In: Problemes Combinatoires et Theorie des Graphes. Colloq. Internat. CNRS, vol. 260, pp. 399–401. CNRS, Paris (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oveis Gharan, S., Trevisan, L. (2013). A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2013 2013. Lecture Notes in Computer Science, vol 8096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40328-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-40328-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40327-9
Online ISBN: 978-3-642-40328-6
eBook Packages: Computer ScienceComputer Science (R0)