TY - GEN
T1 - K-pair delay constrained minimum cost routing in undirected networks
AU - Chen, Guangting
AU - Xue, Guoliang
PY - 2001
Y1 - 2001
N2 - We study a problem related to QoS routing in an undirected network where each edge has a delay and a cost. Given a k-pair routing request {(si, ti, di)|i = l,...,k} where si is ith source node, ti is ith destination node, and dl, is the /th delay tolerance, we want to compute a minimum cost network which contains an si-ti path whose delay is at most di for every i. We present an FPTAS for this problem when k is a constant.
AB - We study a problem related to QoS routing in an undirected network where each edge has a delay and a cost. Given a k-pair routing request {(si, ti, di)|i = l,...,k} where si is ith source node, ti is ith destination node, and dl, is the /th delay tolerance, we want to compute a minimum cost network which contains an si-ti path whose delay is at most di for every i. We present an FPTAS for this problem when k is a constant.
KW - Algorithms
KW - Performance
KW - Reliability
KW - Theory
UR - http://www.scopus.com/inward/record.url?scp=64049088015&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=64049088015&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:64049088015
SN - 0898714907
T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
SP - 230
EP - 231
BT - Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms
T2 - 2001 Operating Section Proceedings, American Gas Association
Y2 - 30 April 2001 through 1 May 2001
ER -