کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
436081 689969 2015 14 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The fault-tolerant capacitated K-center problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
The fault-tolerant capacitated K-center problem
چکیده انگلیسی

The capacitated K-center (CKC) problem calls for locating K service centers in the vertices of a given weighted graph, and assigning each vertex as a client to one of the centers, where each service center has a limited service capacity and thus may be assigned at most L clients, so as to minimize the maximum distance from a vertex to its assigned service center. This paper studies the fault-tolerant version of this problem, where one or more service centers might fail simultaneously. We consider two variants of the problem. The first is the α-fault-tolerant capacitated K-center   (α-FT-CKCα-FT-CKC) problem. In this version, after the failure of some centers, all nodes are allowed to be reassigned to alternate centers. The more conservative version of this problem, hereafter referred to as the α-fault-tolerant conservative capacitated K-center   (α-FT-CKCα-FT-CKC) problem, is similar to the α-FT-CKCα-FT-CKC problem, except that after the failure of some centers, only the nodes that were assigned to those centers before the failure are allowed to be reassigned to other centers. We present polynomial time algorithms that yield 9-approximation for the α-FT-CKCα-FT-CKC problem and 17-approximation for the α-FT-CKCα-FT-CKC problem.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 566, 9 February 2015, Pages 12–25
نویسندگان
, ,