New Upper Bounds in Klee's Measure Problem.

Mark H. Overmars Chee-Keng Yap

Published in: SIAM J. Comput. (1991)

Keyphrases

upper bound
simplex method
lower bound
upper and lower bounds
worst case
similarity measure
tight bounds
distance measure
linear programming
linear program
support vector machine
theoretical analysis
branch and bound
sample complexity
efficiently computable