A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps
نویسندگان
چکیده
In the Directed Disjoint Paths problem, we are given a digraph $D$ and set of requests $\{(s_1, t_1), \ldots, (s_k, t_k)\}$, task is to find collection pairwise vertex-disjoint paths $\{P_1, P_k\}$ such that each $P_i$ path from $s_i$ $t_i$ in $D$. This problem NP-complete for fixed $k=2$ W[1]-hard with parameter $k$ DAGs. A few positive results known under restrictions on input digraph, as being planar or having bounded directed tree-width, relaxations allowing vertex congestion. Positive scarce, however, general digraphs. this article propose novel global congestion metric problem: only require be "disjoint enough", sense they must behave properly not whole graph, but an unspecified part size prescribed by parameter. Namely, Enough $n$-vertex $D$, requests, non-negative integers $d$ $s$, connecting at least vertices occur most $s$ collection. We study parameterized complexity number choices parameter, including tree-width Among other results, show DAGs and, side, give algorithm time $\mathcal{O}(n^{d+2} \cdot k^{d\cdot s})$ kernel $d 2^{k-s}\cdot \binom{k}{s} + 2k$ latter result has consequences Steiner Network it FPT terminals $p$, where $p = n - q$ $q$ solution.
منابع مشابه
The Directed Disjoint Shortest Paths Problem
In the k disjoint shortest paths problem (k-DSPP), we are given a graph and its vertex pairs (s1, t1), . . . , (sk, tk), and the objective is to find k pairwise disjoint paths P1, . . . , Pk such that each path Pi is a shortest path from si to ti, if they exist. If the length of each edge is equal to zero, then this problem amounts to the disjoint paths problem, which is one of the well-studied...
متن کاملA Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion
In the Edge-Disjoint Paths with Congestion problem (EDPwC), we are given an undirected n-vertex graph G, a collection M = {(s1, t1), . . . , (sk, tk)} of demand pairs and an integer c. The goal is to connect the maximum possible number of the demand pairs by paths, so that the maximum edge congestion the number of paths sharing any edge is bounded by c. When the maximum allowed congestion is c ...
متن کاملFinding k Disjoint Paths in a Directed Planar Graph
We show that for each fixed k, the problem of finding k pairwise vertex-disjoint directed paths between given pairs of terminals in a directed planar graph is solvable in polynomial time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2022
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2021.10.023