306 search results - page 2 / 62 » Parallel approximation algorithms for facility-location prob... |
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...
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
COCOA
2007
Springer
13 years 7 months ago
2007
Springer
CORR
2007
Springer
13 years 5 months ago
2007
Springer
ICALP
2011
Springer
12 years 8 months ago
2011
Springer