Shortest (A+B)-path packing via hafnian

TL;DR

This paper extends algebraic algorithms for shortest disjoint path problems to a more general case using hafnian computations, enabling polynomial-time solutions for fixed-size node sets despite NP-hardness.

Contribution

It introduces a novel algebraic approach using hafnian modulo 2^k for shortest path packings, generalizing previous methods and addressing more complex problems.

Findings

The generalized problem is solvable in randomized polynomial time for fixed |A|+|B|.

The algorithm employs hafnian modulo 2^k and Gallai's reduction techniques.

The method extends to other path packing problems, with discussion on its limitations.

Abstract

Bj\"orklund and Husfeldt developed a randomized polynomial time algorithm to solve the shortest two disjoint paths problem. Their algorithm is based on computation of permanents modulo 4 and the isolation lemma. In this paper, we consider the following generalization of the shortest two disjoint paths problem, and develop a similar algebraic algorithm. The shortest perfect $(A+B)$-path packing problem is: given an undirected graph $G$ and two disjoint node subsets $A,B$ with even cardinalities, find a shortest $|A|/2+|B|/2$ disjoint paths whose ends are both in $A$ or both in $B$. Besides its NP-hardness, we prove that this problem can be solved in randomized polynomial time if $|A|+|B|$ is fixed. Our algorithm basically follows the framework of Bj\"orklund and Husfeldt but uses a new technique: computation of hafnian modulo $2^k$ combined with Gallai's reduction from $T$-paths to matchings. We also generalize our technique for solving other path packing problems, and discuss its limitation.