Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
On the complexity of and algorithms for finding the shortest path with a disjoint counterpart
IEEE/ACM Transactions on Networking (TON)
Spare capacity allocation using shared backup path protection for dual link failures
Computer Communications
Hi-index | 0.00 |