Optimal Lower Bounds for Sketching Graph Cuts

Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan. Optimal Lower Bounds for Sketching Graph Cuts. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 2565-2569, SIAM, 2019. [doi]

Abstract

Abstract is missing.