"Optimal Bound on the Combinatorial Complexity of Approximating Polytopes."

Rahul Arya et al. (2019)
a service of Schloss Dagstuhl - Leibniz Center for Informatics