282 search results - page 8 / 57 » Approximation algorithms for facility location problems |
ICCV
2009
IEEE
15 years 11 days ago
2009
IEEE
Subspace segmentation is the task of segmenting data
lying on multiple linear subspaces. Its applications in
computer vision include motion segmentation in video,
structure-from...
TCS
2010
13 years 5 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
IPCO
2004
13 years 8 months ago
2004