Sciweavers

268 search results - page 1 / 54
» Facility location: distributed approximation
Sort
View
PODC
2005
ACM
13 years 10 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
13 years 6 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
ANOR
2007
165views more  ANOR 2007»
13 years 4 months ago
Financial scenario generation for stochastic multi-stage decision processes as facility location problems
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...
Ronald Hochreiter, Georg Ch. Pflug
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 7 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
JCSS
2010
146views more  JCSS 2010»
13 years 3 months ago
Connected facility location via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...