Editorial: Special issue on reconfiguration problems (Q1712044): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/algorithms/Abu-KhzamFU18, #quickstatements; #temporary_batch_1731508824982
 
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/algorithms/Abu-KhzamFU18 / rank
 
Normal rank

Latest revision as of 16:00, 13 November 2024

scientific article
Language Label Description Also known as
English
Editorial: Special issue on reconfiguration problems
scientific article

    Statements

    Editorial: Special issue on reconfiguration problems (English)
    0 references
    0 references
    21 January 2019
    0 references
    Summary: 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 reorganization or repair work that has to be done without interruption to the service that is provided.
    0 references
    reconfiguration problem
    0 references
    computational complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references