Go to the corresponding LIPIcs Volume Portal 
Guruswami, Venkatesan ; Velingker, Ameya ; Velusamy, Santhoshini
pdfformat: 

@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:18:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770446}, ISSN = {18688969}, year = {2017}, volume = {81}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7557}, URN = {urn:nbn:de:0030drops75570}, doi = {10.4230/LIPIcs.APPROXRANDOM.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  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)  
Issue Date:  2017  
Date of publication:  31.07.2017 