کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1142353 | 957143 | 2013 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Network design with a discrete set of traffic matrices
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Network design with a discrete set of traffic matrices Network design with a discrete set of traffic matrices](/preview/png/1142353.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 41, Issue 4, July 2013, Pages 390–396
Journal: Operations Research Letters - Volume 41, Issue 4, July 2013, Pages 390–396
نویسندگان
Gianpaolo Oriolo, Laura Sanità, Rico Zenklusen,