%0 Conference Paper
%B Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
%D 2001
%T Algorithms for facility location problems with outliers
%A Charikar,Moses
%A Khuller, Samir
%A Mount, Dave
%A Narasimhan,Giri
%X Facility location problems are traditionally investigated with the assumption that all the clients are to be provided service. A significant shortcoming of this formulation is that a few very distant clients, called outliers, can exert a disproportionately strong influence over the final solution. In this paper we explore a generalization of various facility location problems (K-center, K-median, uncapacitated facility location etc) to the case when only a specified fraction of the customers are to be served. What makes the problems harder is that we have to also select the subset that should get service. We provide generalizations of various approximation algorithms to deal with this added constraint.
%B Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
%S SODA '01
%I Society for Industrial and Applied Mathematics
%C Philadelphia, PA, USA
%P 642 - 651
%8 2001///
%@ 0-89871-490-7
%G eng
%U http://dl.acm.org/citation.cfm?id=365411.365555