Login / Signup
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes.
Rahul Arya
Sunil Arya
Guilherme Dias da Fonseca
David M. Mount
Published in:
CoRR (2019)
Keyphrases
</>
worst case
lower bound
upper bound
error bounds
complexity bounds
asymptotically optimal
optimal solution
optimal cost
space complexity
approximation algorithms
convex hull
closed form
computational cost
np hard
machine learning
information systems
search engine
real time