The following publications are possibly variants of this publication:
- Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approachTeresa Gomes, Luísa Jorge, Paulo Melo, Rita Girão-Silva. pnc, 31(1):11-22, 2016. [doi]
- SRLG failure-disjoint path pair of min-sum cost in GMPLS networksTeresa Gomes, José Silva, José M. F. Craveirinha, Carlos Simoes. drcn 2011: 196-203 [doi]
- Obtaining a SRLG-disjoint path pair of min-sum costTeresa Gomes, Luis Fernandes. icumt 2010: 582-588 [doi]
- Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum costTeresa Gomes, Carlos Simoes, Luis Fernandes. telsys, 52(2):737-749, 2013. [doi]
- Efficient heuristics for determining node-disjoint path pairs visiting specified nodesLúcia Martins, Teresa Gomes, David Tipper. networks, 70(4):292-307, 2017. [doi]
- An heuristic for maximally SRLG-disjoint path pairs calculationJosé Silva, Teresa Gomes, Luis Fernandes, Carlos Simoes, José M. F. Craveirinha. icumt 2011: 1-8 [doi]