Sciweavers

282 search results - page 14 / 57
» Approximation algorithms for facility location problems
Sort
View
99
Voted
COCOA
2009
Springer
15 years 9 months ago
Improved Bounds for Facility Location Games with Fair Cost Allocation
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
Thomas Dueholm Hansen, Orestis Telelis
CORR
2008
Springer
68views Education» more  CORR 2008»
15 years 2 months ago
Locating Restricted Facilities on Binary Maps
: In this paper we consider several facility location problems with applications to cost and social welfare optimization, when the area map is encoded as a binary (0,1) mxn matrix....
Mugurel Ionut Andreica, Cristina Teodora Andreica,...
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
15 years 9 days ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
MSOM
2008
103views more  MSOM 2008»
15 years 1 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
ORL
1998
116views more  ORL 1998»
15 years 2 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...