Multistage Problems on a Global Budget

by   Klaus Heeger, et al.

Time-evolving or temporal graphs gain more and more popularity when studying the behavior of complex networks. In this context, the multistage view on computational problems is among the most natural frameworks. Roughly speaking, herein one studies the different (time) layers of a temporal graph (effectively meaning that the edge set may change over time, but the vertex set remains unchanged), and one searches for a solution of a given graph problem for each layer. The twist in the multistage setting is that the found solutions may not differ too much between subsequent layers. We relax on this notion by introducing a global instead of the so far local budget view. More specifically, we allow for few disruptive changes between subsequent layers but request that overall, that is, summing over all layers, the degree of change is upper-bounded. Studying several classic graph problems (both NP-hard and polynomial-time solvable ones) from a parameterized angle, we encounter both fixed-parameter tractability and parameterized hardness results. Somewhat surprisingly, we find that sometimes the global multistage versions of NP-hard problems such as Vertex Cover turn out to be computationally easier than the ones of polynomial-time solvable problems such as Matching.


page 1

page 2

page 3

page 4


Multistage Graph Problems on a Global Budget

Time-evolving or temporal graphs gain more and more popularity when stud...

Multistage Vertex Cover

Covering all edges of a graph by a minimum number of vertices, this is t...

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...

Bribery and Control in Stable Marriage

We initiate the study of external manipulations in Stable Marriage by co...

Consistent polynomial-time unseeded graph matching for Lipschitz graphons

We propose a consistent polynomial-time method for the unseeded node mat...

The Complexity of Temporal Vertex Cover in Small-Degree Graphs

Temporal graphs naturally model graphs whose underlying topology changes...

(FPT-)Approximation Algorithms for the Virtual Network Embedding Problem

Many resource allocation problems in the cloud can be described as a bas...