Sciweavers

282 search results - page 21 / 57
» Approximation algorithms for facility location problems
Sort
View
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
15 years 4 months ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
ANOR
2005
98views more  ANOR 2005»
14 years 9 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»
14 years 9 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...
COMPGEOM
2006
ACM
15 years 3 months ago
Minimum-cost load-balancing partitions
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
Boris Aronov, Paz Carmi, Matthew J. Katz
ICALP
2010
Springer
15 years 2 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi