129 search results - page 3 / 26 » Algorithms for facility location problems with outliers |
COCOA
2008
Springer
13 years 9 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...
JMLR
2010
13 years 2 months ago
2010
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
STOC
2005
ACM
14 years 7 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...
APPROX
2000
Springer
13 years 11 months ago
2000
Springer
COCOA
2007
Springer
13 years 9 months ago
2007
Springer
