Log In Sign Up

The Complexity of Packing Edge-Disjoint Paths

by   Jan Dreier, et al.

We introduce and study the complexity of Path Packing. Given a graph G and a list of paths, the task is to embed the paths edge-disjoint in G. This generalizes the well known Hamiltonian-Path problem. Since Hamiltonian Path is efficiently solvable for graphs of small treewidth, we study how this result translates to the much more general Path Packing. On the positive side, we give an FPT-algorithm on trees for the number of paths as parameter. Further, we give an XP-algorithm with the combined parameters maximal degree, number of connected components and number of nodes of degree at least three. Surprisingly the latter is an almost tight result by runtime and parameterization. We show an ETH lower bound almost matching our runtime. Moreover, if two of the three values are constant and one is unbounded the problem becomes NP-hard. Further, we study restrictions to the given list of paths. On the positive side, we present an FPT-algorithm parameterized by the sum of the lengths of the paths. Packing paths of length two is polynomial time solvable, while packing paths of length three is NP-hard. Finally, even the spacial case EPC where the paths have to cover every edge in G exactly once is already NP-hard for two paths on 4-regular graphs.


page 1

page 2

page 3

page 4


Parameterized Complexity of (A,ℓ)-Path Packing

Given a graph G = (V,E), A ⊆ V, and integers k and ℓ, the (A,ℓ)-Path Pac...

The cavity approach for Steiner trees Packing problems

The Belief Propagation approximation, or cavity method, has been recentl...

Parameterized Complexity of Path Set Packing

In PATH SET PACKING, the input is an undirected graph G, a collection P ...

Finding Balance-Fair Short Paths in Graphs

The computation of short paths in graphs with edge lengths is a pillar o...

Priority Algorithms with Advice for Disjoint Path Allocation Problems

We analyze the Disjoint Path Allocation problem (DPA) in the priority fr...

Anticoncentration versus the number of subset sums

Let w⃗ = (w_1,…, w_n) ∈ℝ^n. We show that for any n^-2≤ϵ≤ 1, if #{ξ⃗...

Collective fast delivery by energy-efficient agents

We consider k mobile agents initially located at distinct nodes of an un...