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

Shayan Oveis Gharan, Luca Trevisan. A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs. In Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings. Volume 8096 of Lecture Notes in Computer Science, pages 303-316, Springer, 2013. [doi]

@inproceedings{GharanT13,
  title = {A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs},
  author = {Shayan Oveis Gharan and Luca Trevisan},
  year = {2013},
  doi = {10.1007/978-3-642-40328-6_22},
  url = {http://dx.doi.org/10.1007/978-3-642-40328-6_22},
  researchr = {https://researchr.org/publication/GharanT13},
  cites = {0},
  citedby = {0},
  pages = {303-316},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings},
  editor = {Prasad Raghavendra and Sofya Raskhodnikova and Klaus Jansen and José D. P. Rolim},
  volume = {8096},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-40327-9},
}