Login / Signup
Polynomial-time approximation of largest simplices in V-polytopes.
Asa Packer
Published in:
Discret. Appl. Math. (2004)
Keyphrases
</>
polynomial time approximation
approximation algorithms
np hard
error bounds
vertex cover
bin packing
convex hull
lattice points
packing problem
identical machines
integer programming
search strategies
linear program
extreme points
approximation guarantees
worst case
upper bound
genetic algorithm