A New Approximation Algorithm for Computing 2-Restricted Disjoint Paths


In this paper we study the problem of how to identify multiple disjoint paths that have the minimum total cost OPT and satisfy a delay bound D in a graph G. This problem has lots of applications in networking such as fault-tolerant quality of service (QoS) routing and network-flow load balancing. Recently, several approximation algorithms have been… (More)
DOI: 10.1093/ietisy/e90-d.2.465


3 Figures and Tables