On the Complexity of Solution Extension of Optimization Problems

by   Katrin Casel, et al.

The question if a given partial solution to a problem can be extended reasonably occurs in many algorithmic approaches for optimization problems. For instance, when enumerating minimal dominating sets of a graph G=(V,E), one usually arrives at the problem to decide for a vertex set U ⊆ V, if there exists a minimal dominating set S with U⊆ S. We propose a general, partial-order based formulation of such extension problems and study a number of specific problems which can be expressed in this framework. Possibly contradicting intuition, these problems tend to be NP-hard, even for problems where the underlying optimisation problem can be solved in polynomial time. This raises the question of how fixing a partial solution causes this increase in difficulty. In this regard, we study the parameterised complexity of extension problems with respect to parameters related to the partial solution, as well as the optimality of simple exact algorithms under the Exponential-Time Hypothesis. All complexity considerations are also carried out in very restricted scenarios, be it degree restrictions or topological restrictions (planarity) for graph problems or the size of the given partition for the considered extension variant of Bin Packing.


page 1

page 2

page 3

page 4


Extension of vertex cover and independent set in some classes of graphs and generalizations

We consider extension variants of the classical graph problems Vertex Co...

Hitting the Romans

Roman domination is one of few examples where the related extension prob...

On the tractability of optimization problems on H-graphs

For a graph H, a graph G is an H-graph if it is an intersection graph of...

Paired Domination versus Domination and Packing Number in Graphs

Given a graph G=(V(G), E(G)), the size of a minimum dominating set, mini...

Budgeted Dominating Sets in Uncertain Graphs

We study the Budgeted Dominating Set (BDS) problem on uncertain graphs, ...

An active-set based recursive approach for solving convex isotonic regression with generalized order restrictions

This paper studies the convex isotonic regression with generalized order...

Extending Partial Representations of Rectangular Duals with Given Contact Orientations

A rectangular dual of a graph G is a contact representation of G by axis...

Please sign up or login with your details

Forgot password? Click here to reset