@InProceedings{eden_et_al:LIPIcs.APPROX-RANDOM.2018.11, author = {Eden, Talya and Rosenbaum, Will}, title = {{Lower Bounds for Approximating Graph Parameters via Communication Complexity}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {11:1--11:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-085-9}, ISSN = {1868-8969}, year = {2018}, volume = {116}, editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.11}, URN = {urn:nbn:de:0030-drops-94156}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.11}, annote = {Keywords: sublinear graph parameter estimation, lower bounds, communication complexity} }