Add to ORKGA 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.Network Architectures and ServicesElectrical Engineering, Mathematics and Computer Scienc
The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that ...
The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that ...
The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that ...
Network survivability has been recognized as an issue of major importance in terms of security, sta...
International Research Centre for Telecommunication and RadarNetwork Architectures and Service
Network survivability has drawn certain interest in network optimization. However, the demand for fu...
In communication networks, multiple disjoint communication paths are desirable for many applications...
In communication networks, multiple disjoint communication paths are desirable for many applications...
In communication networks, multiple disjoint communication paths are desirable for many applications...
In transmission networks an important routing problem is to find a pair of link disjoint paths which...
This paper discusses the problem of partially link disjoint paths in communication networks. The pro...
Given a graph G=(V, E) and k source-sink pairs (s1, t1), …, (sk, tk) with each si, ti V...
AbstractGiven a network G = (V,E) and two vertices s and t, we consider the problem of finding two d...
In end-to-end connections it is sometimes not possible to find a totally disjoint path pair. In this...
Consider a network G = (V,E) with distinguished vertices s and t, and with k different costs on ever...
The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that ...
The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that ...
The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that ...
Network survivability has been recognized as an issue of major importance in terms of security, sta...
International Research Centre for Telecommunication and RadarNetwork Architectures and Service
Network survivability has drawn certain interest in network optimization. However, the demand for fu...
In communication networks, multiple disjoint communication paths are desirable for many applications...
In communication networks, multiple disjoint communication paths are desirable for many applications...
In communication networks, multiple disjoint communication paths are desirable for many applications...
In transmission networks an important routing problem is to find a pair of link disjoint paths which...
This paper discusses the problem of partially link disjoint paths in communication networks. The pro...
Given a graph G=(V, E) and k source-sink pairs (s1, t1), …, (sk, tk) with each si, ti V...
AbstractGiven a network G = (V,E) and two vertices s and t, we consider the problem of finding two d...
In end-to-end connections it is sometimes not possible to find a totally disjoint path pair. In this...
Consider a network G = (V,E) with distinguished vertices s and t, and with k different costs on ever...
The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that ...
The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that ...
The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that ...