Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2019.14
URN: urn:nbn:de:0030-drops-114753
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11475/
Fluschnik, Till ; Niedermeier, Rolf ; Rohm, Valentin ; Zschoche, Philipp
Multistage Vertex Cover
| pdf-format: |
|
Abstract
Covering all edges of a graph by a small number of vertices, this is the NP-hard Vertex Cover problem, is among the most fundamental algorithmic tasks. Following a recent trend in studying dynamic and temporal graphs, we initiate the study of Multistage Vertex Cover. Herein, having a series of graphs with same vertex set but over time changing edge sets (known as temporal graph consisting of time layers), the goal is to find for each layer of the temporal graph a small vertex cover and to guarantee that the two vertex cover sets between two subsequent layers differ not too much (specified by a given parameter). We show that, different from classic Vertex Cover and some other dynamic or temporal variants of it, Multistage Vertex Cover is computationally hard even in fairly restricted settings. On the positive side, however, we also spot several fixed-parameter tractability results based on some of the most natural parameterizations.
BibTeX - Entry
@InProceedings{fluschnik_et_al:LIPIcs:2019:11475,
author = {Till Fluschnik and Rolf Niedermeier and Valentin Rohm and Philipp Zschoche},
title = {{Multistage Vertex Cover}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Bart M. P. Jansen and Jan Arne Telle},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11475},
URN = {urn:nbn:de:0030-drops-114753},
doi = {10.4230/LIPIcs.IPEC.2019.14},
annote = {Keywords: NP-hardness, dynamic graph problems, temporal graphs, time-evolving networks, W[1]-hardness, fixed-parameter tractability, kernelization}
}
| Keywords: | NP-hardness, dynamic graph problems, temporal graphs, time-evolving networks, W[1]-hardness, fixed-parameter tractability, kernelization | |
| Seminar: | 14th International Symposium on Parameterized and Exact Computation (IPEC 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 04.12.2019 |
