Special Issue on Reconfiguration Problems

Faisal Abu-Khzam, Henning Fernau, Ryuhei Uehara
2018 Algorithms  
The study of reconfiguration problems has grown into a field of its own. The basic idea is to consider the scenario of moving from one given (feasible) solution to another, maintaining feasibility for all intermediate solutions. The solution space is often represented by a "reconfiguration graph", where vertices represent solutions to the problem in hand and an edge between two vertices means that one can be obtained from the other in one step. A typical application background would be for a
more » ... rganization or repair work that has to be done without interruption to the service that is provided.
doi:10.3390/a11110187 fatcat:fjeoz36p3nbotih2flbsh6yblu