The directed 2-linkage problem with length constraints

07/01/2019
by   Jørgen Bang-Jensen, et al.
0

The weak 2-linkage problem for digraphs asks for a given digraph and vertices s_1,s_2,t_1,t_2 whether D contains a pair of arc-disjoint paths P_1,P_2 such that P_i is an (s_i,t_i)-path. This problem is NP-complete for general digraphs but polynomially solvable for acyclic digraphs <cit.>. Recently it was shown <cit.> that if D is equipped with a weight function w on the arcs which satisfies that all edges have positive weight, then there is a polynomial algorithm for the variant of the weak-2-linkage problem when both paths have to be shortest paths in D. In this paper we consider the unit weight case and prove that for every pair constants k_1,k_2, there is a polynomial algorithm which decides whether the input digraph D has a pair of arc-disjoint paths P_1,P_2 such that P_i is an (s_i,t_i)-path and the length of P_i is no more than d(s_i,t_i)+k_i, for i=1,2, where d(s_i,t_i) denotes the length of the shortest (s_i,t_i)-path. We prove that, unless the exponential time hypothesis (ETH) fails, there is no polynomial algorithm for deciding the existence of a solution P_1,P_2 to the weak 2-linkage problem where each path P_i has length at most d(s_i,t_i)+ clog^1+ϵn for some constant c. We also prove that the weak 2-linkage problem remains NP-complete if we require one of the two paths to be a shortest path while the other path has no restriction on the length.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/15/2023

Long Directed Detours: Reduction to 2-Disjoint Paths

We study an "above guarantee" version of the Longest Path problem in dir...
research
12/29/2017

Interesting Paths in the Mapper

The Mapper produces a compact summary of high dimensional data as a simp...
research
06/14/2022

Sequential Optimization Numbers and Conjecture about Edge-Symmetry and Weight-Symmetry Shortest Weight-Constrained Path

This paper defines multidimensional sequential optimization numbers and ...
research
11/13/2022

A Local-to-Global Theorem for Congested Shortest Paths

Amiri and Wargalla (2020) proved the following local-to-global theorem i...
research
08/18/2017

Non-crossing paths with geographic constraints

A geographic network is a graph whose vertices are restricted to lie in ...
research
02/05/2018

Shortest k-Disjoint Paths via Determinants

The well-known k-disjoint path problem (k-DPP) asks for pairwise vertex-...
research
10/13/2022

Hard to Detect Factors of Univariate Integer Polynomials

We investigate the computational complexity of deciding whether a given ...

Please sign up or login with your details

Forgot password? Click here to reset