ALGORITHMICA
2004
13 years 11 months ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
SODA
2008
ACM
14 years 29 days ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...