Approximability of the Subset Sum Reconfiguration Problem

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...

Full description

Bibliographic Details
Main Authors: Ito, Takehiro (Author), Demaine, Erik D. (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer-Verlag, 2014-04-07T16:53:30Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items