NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem

Glenn Hickey Paz Carmi Anil Maheshwari Norbert Zeh

Published in: CoRR (2008)

Keyphrases

polynomial time approximation
approximation algorithms
np hard
error bounds
identical machines
vertex cover
theoretical analysis
objective function
bin packing
optimal solution
scheduling problem
approximation guarantees