TY - JOUR
T1 - Network design with a discrete set of traffic matrices
AU - Oriolo, Gianpaolo
AU - Sanità, Laura
AU - Zenklusen, Rico
PY - 2013
Y1 - 2013
N2 - In this paper, we deal with network design problems in which we are given a finite set of possible traffic matrices. We settle some questions about the computational complexity of this problem. We also show that, unless P=NP, there is no polynomial-time approximation scheme even on ring networks, a special case that has received considerable attention for a variety of related problems. However, for such networks, we provide a 43-approximation algorithm, and an exact polynomial-time algorithm for the single source case.
AB - In this paper, we deal with network design problems in which we are given a finite set of possible traffic matrices. We settle some questions about the computational complexity of this problem. We also show that, unless P=NP, there is no polynomial-time approximation scheme even on ring networks, a special case that has received considerable attention for a variety of related problems. However, for such networks, we provide a 43-approximation algorithm, and an exact polynomial-time algorithm for the single source case.
KW - Ring network
KW - Robust network design
KW - Single source demands
UR - http://www.scopus.com/inward/record.url?scp=84878008497&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2013.04.011
DO - 10.1016/j.orl.2013.04.011
M3 - Article
AN - SCOPUS:84878008497
SN - 0167-6377
VL - 41
SP - 390
EP - 396
JO - Operations Research Letters
JF - Operations Research Letters
IS - 4
ER -