Sciweavers

73 search results - page 1 / 15
» Facility Location in Sublinear Time
Sort
View
ICALP
2005
Springer
14 years 29 days ago
Facility Location in Sublinear Time
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian...
STACS
2010
Springer
14 years 2 months ago
Robust Fault Tolerant Uncapacitated Facility Location
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...
Shiri Chechik, David Peleg
MSOM
2008
103views more  MSOM 2008»
13 years 7 months ago
Facility Location with Stochastic Demand and Constraints on Waiting Time
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
Opher Baron, Oded Berman, Dmitry Krass
JCO
1998
102views more  JCO 1998»
13 years 7 months ago
Facility Location with Dynamic Distance Functions
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 ...
Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram...
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 7 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen