Optimal Bound on the Combinatorial Complexity of Approximating Polytopes

Rahul Arya, Sunil Arya, Guilherme D. da Fonseca, David M. Mount. Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. In Shuchi Chawla 0001, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. pages 786-805, SIAM, 2020. [doi]

Abstract

Abstract is missing.