Large-Scale Distributed Algorithms for Facility Location with Outliers

Tanmay Inamdar, Shreyas Pai & Sriram V. Pemmaraju
This paper presents fast, distributed, O(1)-approximation algorithms for metric facility location problems with outliers in the Congested Clique model, Massively Parallel Computation (MPC) model, and in the k-machine model. The paper considers Robust Facility Location and Facility Location with Penalties, two versions of the facility location problem with outliers proposed by Charikar et al. (SODA 2001). The paper also considers two alternatives for specifying the input: the input metric can be provided explicitly (as an...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.