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

The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals [ a i , 1 , a i , 2 ] i = 1 n and a target integer T , the ISSP is to find a set of integers, at most one from each interval, such that their sum best approximates the target T b...

Ausführliche Beschreibung