Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph

Citation:

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

{first-name}{last-name}@gmail.com<embed>

Link to my dblp

Publication list

Copyright © 2024 The President and Fellows of Harvard College | Accessibility | Digital Accessibility | Report Copyright Infringement