Algorithms for finding an optimal set of short disjoint paths in a communication network | IEEE Journals & Magazine | IEEE Xplore