An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem
نویسندگان
چکیده
The uncapacitated facility location problem in the following formulation is considered: max S⊆I Z(S) = ∑
منابع مشابه
Distributed Approximation Algorithms for Facility Location Problems
In this paper, some distributed approximation algorithms for uncapacitated facility location problem and fault-tolerant facility location problem are summarized, respectively. The worst-case run time of the distributed version of the uncapacitated facility location problem is ( ) O n , where n is the number of network nodes. In addition, the approximation approach for the fault-tolerant facilit...
متن کاملCuckoo search via Levy flights applied to uncapacitated facility location problem
Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...
متن کاملOn Fault-Tolerant Facility Location
We give a new LP-rounding 1.724-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithm of Shmoys & Swamy. Our work applies a dependent-rounding technique in the domain of facility location. The analysis of our algorithm benefits from, and extends, methods developed for Uncapacitated ...
متن کاملAn Attempt to Design a Better Algorithm for the Uncapacitated Facility Location Problem
The uncapacitated facility location has always been an important problem due to its connection to operational research and infrastructure planning. Byrka obtained an algorithm that is parametrized by γ and proved that it is optimal when γ > 1.6774. He also proved that the algorithm achieved an approximation ratio of 1.50. A later work by Shi Li achieved an approximation factor of 1.488. In this...
متن کاملIntegrating facility location and production planning decisions
Weconsider ametric uncapacitated facility locationproblem where we must assign each customer to a facility and meet the demand of the customer in future time periods through production and inventory decisions at the facility. We show that the problem, in general, is as hard to approximate as the set cover problem. We therefore focus on developing approximation algorithms for special cases of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 93 شماره
صفحات -
تاریخ انتشار 1999