Approximation algorithms for the directed path partition problems

Yong Chen, Zhi-Zhong Chen, Curtis Kennedy +3

Given a directed graph $G=(V,E)$, the $k$-path partition problem is to find a minimum collection of vertex-disjoint directed paths each of order at most $k$ to cover all the ver…