Parameterized algorithms and data reduction for safe convoy routing

Результат исследования: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференциинаучнаярецензирование

4 Цитирования (Scopus)

Аннотация

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 ∈ V, and two integers k, ℓ, we search for a simple s-tpath with at most k vertices and at most ℓ 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 2O(√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 2O(tw) · ℓ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.

Язык оригиналаанглийский
Название основной публикации18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2018
ИздательSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Том65
ISBN (печатное издание)9783959770965
DOI
СостояниеОпубликовано - 1 авг 2018
Событие18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2018 - Helsinki, Финляндия
Продолжительность: 23 авг 201824 авг 2018

Конференция

Конференция18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2018
СтранаФинляндия
ГородHelsinki
Период23.08.201824.08.2018

Fingerprint Подробные сведения о темах исследования «Parameterized algorithms and data reduction for safe convoy routing». Вместе они формируют уникальный семантический отпечаток (fingerprint).

  • Цитировать

    Van Bevern, R., Fluschnik, T., & Tsidulko, O. Y. (2018). Parameterized algorithms and data reduction for safe convoy routing. В 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2018 (Том 65). [10] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/OASIcs.ATMOS.2018.10