@inproceedings{DBLP:conf/approx/GuruswamiVV17,
  author       = {Venkatesan Guruswami and
                  Ameya Velingker and
                  Santhoshini Velusamy},
  editor       = {Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim and
                  David Williamson and
                  Santosh S. Vempala},
  title        = {Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
                  CA, {USA}},
  series       = {LIPIcs},
  volume       = {81},
  pages        = {8:1--8:19},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.8},
  doi          = {10.4230/LIPIcs.APPROX-RANDOM.2017.8},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/GuruswamiVV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"7tcodBgxJnKvqb8Sm","bibbaseid":"guruswami-velingker-velusamy-streamingcomplexityofapproximatingmax2cspandmaxacyclicsubgraph-2017","author_short":["Guruswami, V.","Velingker, A.","Velusamy, S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Venkatesan"],"propositions":[],"lastnames":["Guruswami"],"suffixes":[]},{"firstnames":["Ameya"],"propositions":[],"lastnames":["Velingker"],"suffixes":[]},{"firstnames":["Santhoshini"],"propositions":[],"lastnames":["Velusamy"],"suffixes":[]}],"editor":[{"firstnames":["Klaus"],"propositions":[],"lastnames":["Jansen"],"suffixes":[]},{"firstnames":["José","D.","P."],"propositions":[],"lastnames":["Rolim"],"suffixes":[]},{"firstnames":["David"],"propositions":[],"lastnames":["Williamson"],"suffixes":[]},{"firstnames":["Santosh","S."],"propositions":[],"lastnames":["Vempala"],"suffixes":[]}],"title":"Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph","booktitle":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA","series":"LIPIcs","volume":"81","pages":"8:1–8:19","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2017","url":"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.8","doi":"10.4230/LIPIcs.APPROX-RANDOM.2017.8","timestamp":"Tue, 21 Sep 2021 09:36:24 +0200","biburl":"https://dblp.org/rec/conf/approx/GuruswamiVV17.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/approx/GuruswamiVV17,\n author = {Venkatesan Guruswami and\n Ameya Velingker and\n Santhoshini Velusamy},\n editor = {Klaus Jansen and\n Jos{\\'{e}} D. P. Rolim and\n David Williamson and\n Santosh S. Vempala},\n title = {Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph},\n booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms\n and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,\n CA, {USA}},\n series = {LIPIcs},\n volume = {81},\n pages = {8:1--8:19},\n publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik},\n year = {2017},\n url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.8},\n doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.8},\n timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},\n biburl = {https://dblp.org/rec/conf/approx/GuruswamiVV17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Guruswami, V.","Velingker, A.","Velusamy, S."],"editor_short":["Jansen, K.","Rolim, J. D. P.","Williamson, D.","Vempala, S. S."],"key":"DBLP:conf/approx/GuruswamiVV17","id":"DBLP:conf/approx/GuruswamiVV17","bibbaseid":"guruswami-velingker-velusamy-streamingcomplexityofapproximatingmax2cspandmaxacyclicsubgraph-2017","role":"author","urls":{"Paper":"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.8"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/117/3666.bib","dataSources":["A3rW4SyEF9gWcyMcH"],"keywords":[],"search_terms":["streaming","complexity","approximating","max","2csp","max","acyclic","subgraph","guruswami","velingker","velusamy"],"title":"Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph","year":2017}