License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2018.10
URN: urn:nbn:de:0030-drops-97157
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9715/
Go to the corresponding OASIcs Volume Portal

van Bevern, René ; Fluschnik, Till ; Tsidulko, Oxana Yu.

Parameterized Algorithms and Data Reduction for Safe Convoy Routing

pdf-format:
OASIcs-ATMOS-2018-10.pdf (0.5 MB)

Abstract

We study a problem that models safely routing a convoy through a transportation network, where any vertex adjacent to the travel path of the convoy requires additional precaution: Given a graph G=(V,E), two vertices s,t in V, and two integers k,l, we search for a simple s-t-path with at most k vertices and at most l neighbors. We study the problem in two types of transportation networks: graphs with small crossing number, as formed by road networks, and tree-like graphs, as formed by waterways. For graphs with constant crossing number, we provide a subexponential 2^O(sqrt n)-time algorithm and prove a matching lower bound. We also show a polynomial-time data reduction algorithm that reduces any problem instance to an equivalent instance (a so-called problem kernel) of size polynomial in the vertex cover number of the input graph. In contrast, we show that the problem in general graphs is hard to preprocess. Regarding tree-like graphs, we obtain a 2^O(tw) * l^2 * n-time algorithm for graphs of treewidth tw, show that there is no problem kernel with size polynomial in tw, yet show a problem kernel with size polynomial in the feedback edge number of the input graph.

BibTeX - Entry

@InProceedings{vanbevern_et_al:OASIcs:2018:9715,
  author =	{Ren{\'e} van Bevern and Till Fluschnik and Oxana Yu. Tsidulko},
  title =	{{Parameterized Algorithms and Data Reduction for Safe Convoy Routing}},
  booktitle =	{18th Workshop on Algorithmic Approaches for Transportation  Modelling, Optimization, and Systems (ATMOS 2018)},
  pages =	{10:1--10:19},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-096-5},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{65},
  editor =	{Ralf Bornd{\"o}rfer and Sabine Storandt},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9715},
  URN =		{urn:nbn:de:0030-drops-97157},
  doi =		{10.4230/OASIcs.ATMOS.2018.10},
  annote =	{Keywords: NP-hard problem, fixed-parameter tractability, problem kernelization, shortest path, secluded solution}
}

Keywords: NP-hard problem, fixed-parameter tractability, problem kernelization, shortest path, secluded solution
Collection: 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)
Issue Date: 2018
Date of publication: 28.08.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI