Login / Signup
An asymptotic fully polynomial time approximation scheme for bin covering.
Klaus Jansen
Roberto Solis-Oba
Published in:
Theor. Comput. Sci. (2003)
Keyphrases
</>
polynomial time approximation
error bounds
approximation algorithms
np hard
vertex cover
bin packing
worst case
identical machines
data structure
dynamic programming
linear program