Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph

Venkatesan Guruswami, Ameya Velingker, and Santhoshini Velusamy. 2017. “Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph.” APPROX'17. Publisher's Version

Last updated on 02/07/2021

Contact

Harvard University
(617) 495-1000
Massachusetts Hall
Cambridge, MA 02138
s*last_name*@g.harvard.edu

Follow me on twitter!