Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph. Guruswami, V., Velingker, A., & Velusamy, S. In Jansen, K., Rolim, J. D. P., Williamson, D., & Vempala, S. S., editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, volume 81, of LIPIcs, pages 8:1–8:19, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph [link]Paper  doi  bibtex   
@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}
}

Downloads: 0