A study of 'fault-tolerant' extensions of the edge disjoint paths problem, the k-edge disjoint paths problem and the k-disjoint flow problem. Approximation and online algorithms.
