Given a weighted directed acyclic graph G = (V, D, W) and a set of arches RE & # 39; of rewhere the weights of W They are at the vertices. The problem is partitioning Sun on a minimum number of paths separated from vertices that cover all vertices of Sun subject to restrictions that:
- the weight of each route is maximum k.
- each route must include at least one edge of D & # 39;
What is the complexity of this problem?