33 search results - page 1 / 7 » Improved Primal-Dual Approximation Algorithm for the Connect... |
COCOA
2008
Springer
13 years 7 months ago
2008
Springer
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., cl...
ALGORITHMICA
2004
13 years 5 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 ...
IPCO
2001
13 years 6 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
SODA
2008
ACM
13 years 6 months 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...
COCOA
2007
Springer
13 years 7 months ago
2007
Springer
