A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs

DOI10.1007/978-3-642-40328-6_22zbMath1337.68294arXiv1212.1831MaRDI QIDQ2851865

Luca Trevisan, Shayan Oveis Gharan

Publication date: 4 October 2013

Published in: Theory of Computing, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.1831

zbMATH Keywords

approximation algorithm; maximum cut; regularity lemma; expander graphs; low threshold rank graphs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms