Approximability of the Subset Sum Reconfiguration Problem
The subset sum problem is a well-known NP-complete problem in which we wish to find a packing (subset) of items (integers) into a knapsack with capacity so that the sum of the integers in the packing is at most the capacity of the knapsack and at least a given integer threshold. In this paper, we st...
| Main Authors: | , |
|---|---|
| Outros autores: | |
| Formato: | Artigo |
| Idioma: | en_US |
| Publicado: |
Springer-Verlag
2014
|
| Acceso en liña: | http://hdl.handle.net/1721.1/86057 https://orcid.org/0000-0003-3803-5703 |