Before revision:  We introduce a relaxation of the problem, namely, k-Disjonit Shortest Paths with Congestion-c where every vertex is allowed to route up to c paths.
After revision:  We introduce a relaxation of the problem, namely, k-Disjoint Shortest Paths with Congestion-c where every vertex is allowed to route up to c paths.