Sciweavers

129 search results - page 15 / 26
» Algorithms for facility location problems with outliers
Sort
View
TCS
2008
13 years 7 months ago
The 2-radius and 2-radiian problems on trees
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...
Hung-Lung Wang, Kun-Mao Chao
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
14 years 7 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
ANOR
2005
98views more  ANOR 2005»
13 years 7 months ago
Condorcet Winners for Public Goods
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...
Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian
DAM
2000
126views more  DAM 2000»
13 years 7 months ago
2-Medians in trees with pos/neg weights
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
Rainer E. Burkard, Eranda Çela, Helidon Dol...
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 4 months ago
Differentially Private Approximation Algorithms
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...