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

Rui Diao, Ya-Feng Liu, Yu-Hong Dai

The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals ${\left\{[a_{i,1},a_{i,2}]\right\}}_{i=1}^n$ and a target in…