Login / Signup
NP - Hardness of Largest Contained and Smallest Containing Simplices for V- and H-Polytopes.
Asa Packer
Published in:
Discret. Comput. Geom. (2002)
Keyphrases
</>
np hardness
np hard
approximation algorithms
mixed integer
convex hull
worst case analysis
optimal solution
special case
dynamic environments
valid inequalities