A new fully polynomial time approximation scheme for the interval subset sum problem.

Rui Diao Ya-Feng Liu Yu-Hong Dai

Published in: J. Glob. Optim. (2017)

Keyphrases

polynomial time approximation
approximation algorithms
error bounds
np hard
vertex cover
bin packing
identical machines
special case
dynamic programming