Primal-Dual Algorithms for Connected Facility Location Problems

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 i has a facility opening

• Type: Journal
• Year: 2004
• Where: ALGORITHMICA
• Authors: Chaitanya Swamy, Amit Kumar
• Keywords: ALGORITHMICA 2004, Connected Facility Location