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

In the connected facility location (ConFL) problem, we are given a graph G=( V, E) with nonnegative edge cost c e on the edges, a set of facilities ℱ⊆ V, a set of demands (i.e., clients)$\mathcal{D}\subseteq V$, and a parameter M≥1. Each facility i has a nonnegative opening cost f i and each client...

Full description

Published in: Journal of Combinatorial Optimization, Vol. 18, No. 3 (2009), p. 258-271 ; electronic Article English 1573-2886 This research was supported by KOSEF Grant R01-2007-000-11905-0. Online-Ressource 10.1007/s10878-009-9227-8 Show QR Code

 Published in: Journal of Combinatorial Optimization, Vol. 18, No. 3 (2009), p. 258-271
 Further Information: http://dx.doi.org/10.1007/s10878-009-9227-8
Feedback Delivery Service