IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v28y2014i3d10.1007_s10878-012-9562-z.html
   My bibliography  Save this article

Approximability of the subset sum reconfiguration problem

Author

Listed:
  • Takehiro Ito

    (Tohoku University)

  • Erik D. Demaine

    (MIT Computer Science and Artificial Intelligence Laboratory)

Abstract

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 study the problem of reconfiguring one packing into another packing by moving only one item at a time, while at all times maintaining the feasibility of packings. First we show that this decision problem is strongly NP-hard, and is PSPACE-complete if we are given a conflict graph for the set of items in which each vertex corresponds to an item and each edge represents a pair of items that are not allowed to be packed together into the knapsack. We then study an optimization version of the problem: we wish to maximize the minimum sum among all packings in a reconfiguration. We show that this maximization problem admits a polynomial-time approximation scheme, while the problem is APX-hard if we are given a conflict graph.

Suggested Citation

  • Takehiro Ito & Erik D. Demaine, 2014. "Approximability of the subset sum reconfiguration problem," Journal of Combinatorial Optimization, Springer, vol. 28(3), pages 639-654, October.
    • Handle: RePEc:spr:jcomop:v:28:y:2014:i:3:d:10.1007_s10878-012-9562-z
    DOI: 10.1007/s10878-012-9562-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9562-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-012-9562-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:28:y:2014:i:3:d:10.1007_s10878-012-9562-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.