ویراساینس.
مقاله‌ی دسترسی آزاد

Approximating activation edge-cover and facility location problems

['Zeev Nutov', 'Eli Shalom', '']

چکیده

What approximation ratio can we achieve for the Facility Location problem if whenever a client u connects to facility v, opening cost of v is at most θ times service u? We show that this and many other problems are particular case Activation Edge-Cover problem. Here given multigraph G=(V,E), set R⊆V terminals, thresholds {tue,tve} each uv-edge e∈E. The goal find an assignment a={av:v∈V} nodes minimizing ∑v∈Vav, such edge Ea={e=uv:au≥tue,av≥tve} activated by covers R. obtain 1+maxx≥1⁡ln⁡x1+x/θ≈ln⁡θ−ln⁡ln⁡θ problem, where θ≤maxe∈E⁡max⁡{tue,tve}min⁡{tue,tve} parameter. This result based on simple generic algorithm sum decreasing sub-additive functions, which independent interest. As application, get same above variant Location. If all costs identical then better 1+maxk∈N⁡Hk−11+k/θ, Hk=∑i=1k1/i. For Min-Power improve 1.406 [4] (achieved iterative randomized rounding) 1.2785. unit 73/60≈1.217 15551347≈1.155.

اسناد مشابه

  • Local-Search based Approximation Algorithms for Mobile Facility Location Problems

    سند علمی۲۰۱۳SODASara Ahmadian, Zachary Friggstad, Chaitanya Swamy

    We consider the mobile facility location (MFL) problem. We are given a set of facilities and clients located in a common metric space G = (V, c). The goal is to move each facility from its initial location to a destination (in V ) and assign each client to the destination of some

  • Approximation Algorithms for Metric Facility Location Problems

    سند علمی۲۰۰۶SIAM J. Comput.Mohammad Mahdian, Yinyu Ye, Jiawei Zhang

    In this paper we present a 1.52-approximation algorithm for the metric uncapacitated facility location problem, and a 2-approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known appro

  • An approximation algorithm for a facility location problem with stochastic demands and inventories

    سند علمی۲۰۰۶Oper. Res. Lett.Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren

    In this article we propose, for any > 0, a 2(1 + )-approximation algorithm for a facility location problem with stochastic demands. This problem can be described as follows. There are a number of locations, where facilities may be opened and a number of demand points, where reque

  • Improved Approximation Algorithms for Capacitated Facility Location Problems

    سند علمی۱۹۹۹IPCOFabián A. Chudak, David P. Williamson

    In a surprising result, Korupolu, Plaxton, and Rajaraman [13] showed that a simple local search heuristic for the capacitated facility location problem (CFLP) in which the service costs obey the triangle inequality produces a solution in polynomial time which is within a factor o

  • Approximation Algorithms for Bounded Facility Location Problems

    سند علمی۲۰۰۱J. Comb. Optim.Piotr Krysta, Roberto Solis-Oba

    The bounded k-median problem is to select in an undirected graph G = (V, E) a set S of k vertices such that the distance from any vertex v ∈ V to S is at most a given bound d and the average distance from vertices V\S to S is minimized. We present randomized algorithms for severa

  • An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands

    سند علمی۲۰۰۵AAIMAdriana Felicia Gabor, Jan-Kees C. W. van Ommeren

    In this article we propose, for any > 0, a 2(1+ )-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. The incurred c