Algorithms for facility location problems with outliers

d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are to be provided service. A signi cant shortcoming of this formulation is that a few very distant clients, called outliers, can exert a disproportionately strong in uence over the nal 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 speci ed 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.

• Type: Conference
• Year: 2001
• Where: SODA
• Authors: Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan
• Keywords: Algorithms, Facility Location Problems, Giri Narasimhanx Facility, Moses Charikar Samir, SODA 2001