207 search results - page 9 / 42 » Improved Approximation Algorithm for Connected Facility Loca... |
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
97
Voted
JCO
1998
14 years 11 months ago
1998
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
SODA
2000
ACM
15 years 1 months ago
2000
ACM
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
101
Voted
ICCV
2009
IEEE
16 years 4 months 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...
COR
2007
14 years 11 months ago
2007
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...