306 search results - page 2 / 62 » Parallel approximation algorithms for facility-location prob... |
103
Voted
COCOA
2008
Springer
15 years 5 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...
104
Voted
APPROX
2000
Springer
15 years 8 months ago
2000
Springer
122
Voted
COCOA
2007
Springer
15 years 5 months ago
2007
Springer
105
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
