A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes.
Menelaos I. KaravelasEleni TzanakiPublished in: SoCG (2015)
Keyphrases
- upper bound
- convex hull
- minkowski sum
- lower bound
- worst case
- convex polyhedra
- lower and upper bounds
- branch and bound algorithm
- knn
- distance transform
- minimum distance
- branch and bound
- convex optimization
- distance metric
- von neumann
- convex sets
- valid inequalities
- generalization error
- lattice points
- convex constraints
- packing problem
- mixed integer
- globally optimal
- risk minimization
- inequality constraints
- digital topology
- binary matrix
- error probability
- sample complexity
- random variables
- mathematical morphology