A New Fully Polynomial Time Approximation Scheme for the Interval Subset Sum Problem.

Rui Diao Ya-Feng Liu Yu-Hong Dai

Published in: CoRR (2017)

Keyphrases

polynomial time approximation
np hard
approximation algorithms
error bounds
vertex cover
linear program
minimum cost
bin packing
identical machines
special case
cost function
simulated annealing
linear programming