News
In this paper, we devise a polynomial-time approximation scheme for general instances of the incremental knapsack problem, which is the strongest guarantee possible given existing hardness results. In ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results