316 search results - page 2 / 64 » Approximation algorithms for hierarchical location problems |
STOC
2005
ACM
14 years 5 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
JCO
2008
13 years 5 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
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
