1. AN IMPROVED ALGORITHM FOR THE HALF-DISJOINT PATHS PROBLEM.
- Author
-
Kawarabayashi, Ken-Ichi and Kobayashi, Yusuke
- Subjects
MATHEMATICS ,POLYNOMIALS ,ALGORITHMS ,FOUNDATIONS of arithmetic ,COMPUTER systems ,GRAPH theory - Abstract
In this paper, we consider the half-integral disjoint paths packing. For a graph G and k pairs of vertices (s
1 , t1 ), (s2 , t2 ), …, (sk , tk ) in G, the objective is to find paths P1 , …, Pk in G such that Pi joins si and ti for i = 1, 2, …, k, and in addition, each vertex is on at most two of these paths. We give a polynomial-time algorithm to decide the feasibility of this problem with k = O((log n/log log n)1/7 ). This improves a result by Kleinberg [Proceedings of the 30th ACM Symposium on Theory of Computing, 1998, pp 530-539] who proved the same conclusion when k = O((log log n)2/15 ). Our algorithm still works for several problems related to the bounded unsplittable flow. These results can all carry over to problems involving edge capacities. Our main technical contribution is to give a "crossbar" of a polynomial size of the tree width of the graph. [ABSTRACT FROM AUTHOR]- Published
- 2011
- Full Text
- View/download PDF