Login / Signup
New upper bounds in Klee's measure problem (extended abstract)
Mark H. Overmars
Chee-Keng Yap
Published in:
FOCS (1988)
Keyphrases
</>
extended abstract
upper bound
simplex method
lower bound
upper and lower bounds
linear programming
similarity measure
distance measure
linear program
lower and upper bounds
tight bounds
convergence rate
optimal solution
worst case
learning tasks
branch and bound