Routing with congestion in acyclic digraphs

Routing with congestion in acyclic digraphs

We study the version of the k-disjoint paths problem where k demand pairs (s1,t1), …, (sk,tk) are specified in the input and the paths in the solution are allowed to intersect, but such that no vertex is on more than c paths. We show that on directed acyclic graphs the problem is solvable in time nO...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters Vol. 151; p. 105836
Main Authors: Akhoondian Amiri, Saeed, Kreutzer, Stephan, Marx, Dániel, Rabinovich, Roman
Format: Journal Article
Language:English
Published: Elsevier B.V 01-11-2019
Subjects:
Acyclic digraphs
Algorithms
Congestion
Disjoint paths
W-hard
W-hard
Acyclic digraphs
Algorithms
Congestion
Disjoint paths
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the version of the k-disjoint paths problem where k demand pairs (s1,t1), …, (sk,tk) are specified in the input and the paths in the solution are allowed to intersect, but such that no vertex is on more than c paths. We show that on directed acyclic graphs the problem is solvable in time nO(d) if we allow congestion k−d for k paths. Furthermore, we show that, under a suitable complexity theoretic assumption, the problem cannot be solved in time f(k)no(d/log⁡d) for any computable function f.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2019.105836