Highly Influenced

@inproceedings{Beshir2009VariantsOT, title={Variants of the Min-Sum Link-Disjoint Paths Problem}, author={Anteneh Beshir and Fernando Kuipers}, year={2009} }

- Published 2009

A survivable connection usually requires computing link-disjoint primary and backup paths. Finding a min-sum pair of link-disjoint paths whose total cost is minimized can be solved in polynomial time. However, adding extra requirements may render the problem NP-complete. In this paper, we study different variants of the min-sum link-disjoint paths problem. We examine the complexity of these problem variants and provide exact and heuristic algorithms for them.