**Reference**:- Takehiro Ito and Erik D. Demaine, “Approximability of the Subset Sum Reconfiguration Problem”, in
*Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011)*, Lecture Notes in Computer Science, volume 6648, Tokyo, Japan, May 23–25, 2011, pages 58–69. **Comments**:- This paper is also available from SpringerLink.
**Updates**:- Unfortunately Theorem 1 and Corollary 1 are flawed. However, dropping the word “strongly”, the results still hold. Read our erratum.
**Length**:- The paper is 14 pages.
**Availability**:- The paper is available in PDF (392k).
- See information on file formats.
- [Google Scholar search]
**Related papers**:- SubsetSumReconfiguration_JOCO (Approximability of the Subset Sum Reconfiguration Problem)
- NPReconfiguration_TCS (On the Complexity of Reconfiguration Problems)
- NPReconfiguration_WADS2009 (Reconfiguration of List Edge-Colorings in a Graph)
- NPReconfiguration_ISAAC2008 (On the Complexity of Reconfiguration Problems)

See also other papers by Erik Demaine.

Last updated November 20, 2018 by Erik Demaine.