Towards a Unified Theory of Sparsification for Matching Problems

Sepehr Assadi, Aaron Bernstein. Towards a Unified Theory of Sparsification for Matching Problems. In Jeremy T. Fineman, Michael Mitzenmacher, editors, 2nd Symposium on Simplicity in Algorithms, SOSA@SODA 2019, January 8-9, 2019 - San Diego, CA, USA. Volume 69 of OASICS, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]

Authors

Sepehr Assadi

This author has not been identified. Look up 'Sepehr Assadi' in Google

Aaron Bernstein

This author has not been identified. Look up 'Aaron Bernstein' in Google