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

by   Sapna Grover, et al.

With growing emphasis on e-commerce marketplace platforms where we have a central platform mediating between the seller and the buyer, it becomes important to keep a check on the availability and profitability of the central store. A store serving too less clients can be non-profitable and a store getting too many orders can lead to bad service to the customers which can be detrimental for the business. In this paper, we study the facility location problem(FL) with upper and lower bounds on the number of clients an open facility serves. Constant factor approximations are known for the restricted variants of the problem with only the upper bounds or only the lower bounds. The only work that deals with bounds on both the sides violates both the bounds [8]. In this paper, we present the first (constant factor) approximation for the problem violating the upper bound by a factor of (5/2) without violating the lower bounds when both the lower and the upper bounds are uniform. We first give a tri-criteria (constant factor) approximation violating both the upper and the lower bounds and then get rid of violation in lower bounds by transforming the problem instance to an instance of capacitated facility location problem.


page 1

page 2

page 3

page 4


Constant factor approximations for Lower and Upper bounded Clusterings

Clustering is one of the most fundamental problem in Machine Learning. R...

On Variants of Facility Location Problem with Outliers

In this work, we study the extension of two variants of the facility loc...

On Facility Location with General Lower Bounds

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

Online bin stretching lower bounds: Improved search of computational proofs

Online bin stretching is an online problem where some items must be pack...

Complexity of controlled bad sequences over finite sets of N^d

We provide upper and lower bounds for the length of controlled bad seque...

Lower bounds for the maximum number of runners that cause loneliness, and its application to Isolation

We consider (n+1) runners with given constant unique integer speeds runn...

The one-visibility Localization game

We introduce a variant of the Localization game in which the cops only h...

Please sign up or login with your details

Forgot password? Click here to reset