Multistage Problems on a Global Budget

@article{Heeger2021MultistagePO,
  title={Multistage Problems on a Global Budget},
  author={Klaus Heeger and Anne-Sophie Himmel and Frank Kammer and Rolf Niedermeier and Malte Renken and Andrej Sajenko},
  journal={Theor. Comput. Sci.},
  year={2021},
  volume={868},
  pages={46-64}
}
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… Expand
A Multistage View on 2-Satisfiability
TLDR
It is proved that Multistage 2-SAT is NP-hard even in quite restricted cases and parameterized algorithms for Multistages are presented and proved to be asymptotically optimal. Expand
Comparing temporal graphs using dynamic time warping
TLDR
This work defines the dynamic temporal graph warping (dtgw) distance to determine the dissimilarity of two temporal graphs and develops a quadratic programming formulation and an efficient heuristic. Expand
Approximating Multistage Matching Problems
TLDR
It is shown that multistage perfect matching problems are NP-hard even in very restricted scenarios, and new approximation algorithms and methods are proposed to transfer results between different problem variants without loosing approximation guarantees. Expand
Comparing Temporal Graphs Using Dynamic Time Warping
TLDR
This work defines the dynamic temporal graph warping distance (dtgw) to determine the (dis)similarity of two temporal graphs and develops an efficient heuristic which performs well in empirical studies and performs favorably in de-anonymizing networks. Expand
Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions
TLDR
This work systematically review different types of arising settings, point out how classical problems and solution concepts can be generalized, and identify several research challenges. Expand
A Faster Parameterized Algorithm for Temporal Matching
TLDR
An improved algorithm is shown to compute a $\Delta$-temporal matching of maximum size with a running time of $Delta^{O(\nu)}\cdot |\mathcal G|$ and hence provide an exponential speedup in terms of $\Delta$. Expand
FPT-space Graph Kernelizations
TLDR
The authors' kernelization for Feedback Vertex Set computes in a first step an approximated solution, which can be used to build a simple algorithm for undirected $s$-$t$-connectivity that runs in polynomial time and with $O(\mathrm{poly}(k) \log n)$ bits. Expand
Multistage s-t Path: Confronting Similarity with Dissimilarity
TLDR
It is proved that dissimilarity allows for fixed-parameter tractability for the parameter solution size, contrasting the W[1]-hardness proof of the corresponding similarity case. Expand

References

SHOWING 1-10 OF 42 REFERENCES
Dynamic Parameterized Problems
TLDR
The parameterized complexity of various graph theoretic problems in the dynamic framework where the input graph is being updated by a sequence of edge additions and deletions is studied and improved algorithms and linear kernels are described. Expand
Multistage Vertex Cover
TLDR
The goal is to find for each layer of the temporal graph a small vertex cover and to guarantee that two vertex cover sets of every two consecutive layers differ not too much (specified by a given parameter). Expand
Parameterized Dynamic Cluster Editing
TLDR
A dynamic version of the NP -hard graph modification problem Cluster Editing is introduced, providing a fairly complete picture of the parameterized computational complexity landscape under the two perhaps most natural parameterizations. Expand
On the parameterized complexity of dynamic problems
TLDR
A study of the dynamic versions of a number of problems including Vertex cover, Maximum Clique, Connected Vertex Cover and Connected Dominating Set, and introduces the reoptimization parameter, which bounds the difference between the cardinalities of initial and target solutions. Expand
Facility Location in Evolving Metrics
TLDR
This work introduces a time-dependent, dynamic version of the facility location problem, which includes a switching cost when a client’s assignment changes from one facility to another, to provide a better representation of an evolving network. Expand
Incremental list coloring of graphs, parameterized by conservation
TLDR
It is shown that even on bipartite graphs the problem is NP-hard for k>=3 and W[1]-hard for an unbounded number of colors when parameterized by c, and fixed-parameter tractability for the combined parameter treewidth and number k of colors is shown. Expand
Contracting Graphs to Paths and Trees
TLDR
It is shown that Path Contraction has a kernel with at most 5k+3 vertices, while Tree Contraction does not have a polynomial kernel unless NP ⊆ coNP/poly, which is surprising. Expand
LP-based algorithms for multistage minimization problems
TLDR
A new two-threshold rounding scheme, tailored for multistage problems, is introduced and it is shown that this rounding scheme gives a 2$f$-approximation algorithm for the multistages variant of the f-Set Cover problem, where each element belongs to at most f sets. Expand
Computing Maximum Matchings in Temporal Graphs
TLDR
This paper introduces and studies the complexity of a natural temporal extension of the classical graph problem Maximum Matching, taking into account the dynamic nature of temporal graphs, and proves strong computational hardness results for Maximum Temporal Matching. Expand
Space-efficient, Fast and Exact Routing in Time-dependent Road Networks
TLDR
This work introduces CATCHUp (Customizable Approximated Time-dependent Contraction Hierarchies through Unpacking), the first algorithm that simultaneously achieves all three objectives of shortest paths in massive road networks with traffic predictions. Expand
...
1
2
3
4
5
...