Better Approximations for Tree Sparsity in Nearly-Linear Time

Arturs Backurs, Piotr Indyk, Ludwig Schmidt. Better Approximations for Tree Sparsity in Nearly-Linear Time. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 2215-2229, SIAM, 2017. [doi]

Abstract

Abstract is missing.