220 search results - page 17 / 44 » Primal-Dual Algorithms for Connected Facility Location Probl... |
130
click to vote
FSTTCS
1993
Springer
15 years 3 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
ESA
2000
Springer
15 years 3 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
108
click to vote
TCS
2008
14 years 11 months ago
2008
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two no...
ANOR
2005
14 years 11 months ago
2005
In this work, we consider a public facility allocation problem decided through a voting process under the majority rule. A location of the public facility is a majority rule winner...