Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
From MaRDI portal
Publication:5146818
DOI10.1137/1.9781611975994.48MaRDI QIDQ5146818
Rahul Arya, David M. Mount, Sunil Arya, Guilherme Dias da Fonseca
Publication date: 2 February 2021
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.14459
68Wxx: Algorithms in computer science