Special Issue on Reconfiguration Problems
AbstractThe 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 reorganization or repair work that has to be done without interruption to the service that is provided. View Full-Text
Share & Cite This Article
Abu-Khzam, F.; Fernau, H.; Uehara, R. Special Issue on Reconfiguration Problems. Algorithms 2018, 11, 187.
Abu-Khzam F, Fernau H, Uehara R. Special Issue on Reconfiguration Problems. Algorithms. 2018; 11(11):187.Chicago/Turabian Style
Abu-Khzam, Faisal; Fernau, Henning; Uehara, Ryuhei. 2018. "Special Issue on Reconfiguration Problems." Algorithms 11, no. 11: 187.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.