Approximability of the subset sum reconfiguration problem
Open Access
- 7 December 2012
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 28 (3) , 639-654
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Reconfiguration of list edge-colorings in a graphDiscrete Applied Mathematics, 2012
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a TreeIEICE Transactions on Information and Systems, 2012
- On the diameter of reconfiguration graphs for vertex colouringsElectronic Notes in Discrete Mathematics, 2011
- On the complexity of reconfiguration problemsTheoretical Computer Science, 2011
- On the Boolean connectivity problem for Horn relationsDiscrete Applied Mathematics, 2010
- Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distancesTheoretical Computer Science, 2009
- The Connectivity of Boolean Satisfiability: Computational and Structural DichotomiesSIAM Journal on Computing, 2009
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computationTheoretical Computer Science, 2005
- Knapsack Problems2004
- Clique is hard to approximate within n1−εActa Mathematica, 1999