An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering.

Klaus Jansen Roberto Solis-Oba

Published in: ISAAC (2002)

Keyphrases

polynomial time approximation
approximation algorithms
np hard
error bounds
vertex cover
worst case
identical machines
query processing
special case
supervised learning
theoretical analysis
asymptotically optimal