Go to the corresponding LIPIcs Volume Portal |
Guruswami, Venkatesan ; Velingker, Ameya ; Velusamy, Santhoshini
pdf-format: |
|
@InProceedings{guruswami_et_al:LIPIcs:2017:7557, author = {Venkatesan Guruswami and Ameya Velingker and Santhoshini Velusamy}, title = {{Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {8:1--8:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-044-6}, ISSN = {1868-8969}, year = {2017}, volume = {81}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7557}, URN = {urn:nbn:de:0030-drops-75570}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.8}, annote = {Keywords: approximation algorithms, constraint satisfaction problems, optimization, hardness of approximation, maximum acyclic subgraph} }
Keywords: | approximation algorithms, constraint satisfaction problems, optimization, hardness of approximation, maximum acyclic subgraph | |
Collection: | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) | |
Issue Date: | 2017 | |
Date of publication: | 11.08.2017 |