Optimal Bound on the Combinatorial Complexity of Approximating Polytopes.

Rahul Arya Sunil Arya Guilherme Dias da Fonseca David M. Mount

Published in: SODA (2020)

Keyphrases

worst case
upper bound
lower bound
computational cost
computational complexity
dynamic programming
data sets
worst case analysis
optimal solution
optimal design
decision problems
integer solution
optimal cost
complexity bounds
asymptotically optimal
space complexity
exhaustive search
error bounds
case study