Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1414041,
author = {Ganian, Robert and Ordyniak, Sebastian and Ramanujan, M.S.},
address = {Nemecko},
booktitle = {28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand},
doi = {http://dx.doi.org/10.4230/LIPIcs.ISAAC.2017.36},
edition = {92},
editor = {Yoshio Okamoto; Takeshi Tokuyama},
keywords = {Edge Disjont Paths; Parameterized Complexity; Treewidth},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Nemecko},
isbn = {978-3-95977-054-5},
pages = {1-13},
publisher = {LIPIcs},
title = {On Structural Parameterizations of the Edge Disjoint Paths Problem},
url = {http://drops.dagstuhl.de/opus/volltexte/2017/8255/},
year = {2017}
}
TY - JOUR
ID - 1414041
AU - Ganian, Robert - Ordyniak, Sebastian - Ramanujan, M.S.
PY - 2017
TI - On Structural Parameterizations of the Edge Disjoint Paths Problem
PB - LIPIcs
CY - Nemecko
SN - 9783959770545
KW - Edge Disjont Paths
KW - Parameterized Complexity
KW - Treewidth
UR - http://drops.dagstuhl.de/opus/volltexte/2017/8255/
L2 - http://drops.dagstuhl.de/opus/volltexte/2017/8255/
N2 - In this paper we revisit the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P. Our focus lies on structural parameterizations for the problem that allow for efficient (polynomial-time or fpt) algorithms. As our first result, we answer an open question stated in Fleszar, Mnich, and Spoerhase (2016), by showing that the problem can be solved in polynomial time if the input graph has a feedback vertex set of size one. We also show that EDP parameterized by the treewidth and the maximum degree of the input graph is fixed-parameter tractable. Having developed two novel algorithms for EDP using structural restrictions on the input graph, we then turn our attention towards the augmented graph, i.e., the graph obtained from the input graph after adding one edge between every terminal pair. In constrast to the input graph, where EDP is known to remain NP-hard even for treewidth two, a result by Zhou et al. (2000) shows that EDP can be solved in non-uniform polynomial time if the augmented graph has constant treewidth; we note that the possible improvement of this result to an fpt-algorithm has remained open since then. We show that this is highly unlikely by establishing the W[1]-hardness of the problem parameterized by the treewidth (and even feedback vertex set) of the augmented graph. Finally, we develop an fpt-algorithm for EDP by exploiting a novel structural parameter of the augmented graph.
ER -
GANIAN, Robert, Sebastian ORDYNIAK a M.S. RAMANUJAN. On Structural Parameterizations of the Edge Disjoint Paths Problem. Online. In Yoshio Okamoto; Takeshi Tokuyama. \textit{28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand}. 92. vyd. Nemecko: LIPIcs, 2017, s.~1-13. ISBN~978-3-95977-054-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ISAAC.2017.36.
|
