On Solution Discovery via Reconfiguration

by   Michael R. Fellows, et al.

The dynamics of real-world applications and systems require efficient methods for improving infeasible solutions or restoring corrupted ones by making modifications to the current state of a system in a restricted way. We propose a new framework of solution discovery via reconfiguration for constructing a feasible solution for a given problem by executing a sequence of small modifications starting from a given state. Our framework integrates and formalizes different aspects of classical local search, reoptimization, and combinatorial reconfiguration. We exemplify our framework on a multitude of fundamental combinatorial problems, namely Vertex Cover, Independent Set, Dominating Set, and Coloring. We study the classical as well as the parameterized complexity of the solution discovery variants of those problems and explore the boundary between tractable and intractable instances.


page 1

page 2

page 3

page 4


On the hardness of losing weight

We study the complexity of local search for the Boolean constraint satis...

Reoptimization of Parameterized Problems

Parameterized complexity allows us to analyze the time complexity of pro...

On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets

In a reconfiguration version of an optimization problem Q the input is a...

Consistency-Checking Problems: A Gateway to Parameterized Sample Complexity

Recently, Brand, Ganian and Simonov introduced a parameterized refinemen...

Reinforcement learning based local search for grouping problems: A case study on graph coloring

Grouping problems aim to partition a set of items into multiple mutually...

Lipschitz Continuous Algorithms for Covering Problems

Combinatorial algorithms are widely used for decision-making and knowled...

Please sign up or login with your details

Forgot password? Click here to reset