On Variants of Facility Location Problem with Outliers

by   Rajni Dabas, et al.

In this work, we study the extension of two variants of the facility location problem (FL) to make them robust towards a few distantly located clients. First, k-facility location problem (kFL), a common generalization of FL and k median problems, is a well studied problem in literature. In the second variant, lower bounded facility location (LBFL), we are given a bound on the minimum number of clients that an opened facility must serve. Lower bounds are required in many applications like profitability in commerce and load balancing in transportation problem. In both the cases, the cost of the solution may be increased grossly by a few distantly located clients, called the outliers. Thus, in this work, we extend kFL and LBFL to make them robust towards the outliers. For kFL with outliers (kFLO) we present the first (constant) factor approximation violating the cardinality requirement by +1. As a by-product, we also obtain the first approximation for FLO based on LP-rounding. For LBFLO, we present a tri-criteria solution with a trade-off between the violations in lower bounds and the number of outliers. With a violation of 1/2 in lower bounds, we get a violation of 2 in outliers.


page 1

page 2

page 3

page 4


First Approximation for Uniform Lower and Upper Bounded Facility Location Problem avoiding violation in Lower Bounds

With growing emphasis on e-commerce marketplace platforms where we have ...

On Facility Location with General Lower Bounds

In this paper, we give the first constant approximation algorithm for th...

Achieving anonymity via weak lower bound constraints for k-median and k-means

We study k-clustering problems with lower bounds, including k-median and...

Uniform Capacitated Facility Location Problems with Penalties/Outliers

In this paper, we present a framework to design approximation algorithms...

Fixed-parameter algorithms for maximum-profit facility location under matroid constraints

We consider a variant of the matroid median problem introduced by Krishn...

Submodularity Gaps for Selected Network Design and Matching Problems

Submodularity in combinatorial optimization has been a topic of many stu...

Facility location under matroid constraints: fixed-parameter algorithms and applications

We study an NP-hard uncapacitated discrete facility location problem: Th...

Please sign up or login with your details

Forgot password? Click here to reset