A 6.55 factor primal-dual approximation algorithm for the connected facility location problem

@article{Jung2009A6F,
title={A 6.55 factor primal-dual approximation algorithm for the connected facility location problem},
author={Hyunwoo Jung and Mohammad Khairul Hasan and Kyung-Yong Chwa},
journal={J. Comb. Optim.},
year={2009},
volume={18},
pages={258-271}
}

In the connected facility location (ConFL) problem, we are given a graph G = (V ,E) with nonnegative edge cost ce on the edges, a set of facilities F ⊆ V , a set of demands (i.e., clients) D ⊆ V , and a parameter M ≥ 1. Each facility i has a nonnegative opening cost fi and each client j has dj units of demand. Our objective is to open some facilities, say F ⊆ F , assign each demand j to some open facility i(j) ∈ F and connect all open facilities using a Steiner tree T such that the total cost… CONTINUE READING