A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope.
Hervé FournierAntoine VigneronPublished in: Algorithmica (2007)
Keyphrases
- lower bound
- upper bound
- convex hull
- branch and bound algorithm
- branch and bound
- worst case
- lower and upper bounds
- objective function
- np hard
- semidefinite
- optimal solution
- convex optimization
- lattice points
- lower bounding
- upper and lower bounds
- cutting plane
- sample complexity
- piecewise linear
- knapsack problem
- linear programming relaxation
- online learning
- stable set
- special case