In the maximum facility location problem, we are given a set of clients C and facilities F . Assigning a client u to a facility v incurs a cost w uv and each facility has an associated interval I v on the real line. Our goal is to assign as many clients to open facilities in order to maximise the cost of assignment, subject to the constraint that open facilities cannot have their respective int...

We present a deterministic kinetic data structure for the facility location problem that maintains a subset of the moving points as facilities such that, at any point of time, the accumulated cost for the whole point set is at most a constant factor larger than the current optimal cost. At any point of time, the cost that arise for a point depends on the status and the position of the point. In...

Jain et al. proposed two well-known algorithms for the Metric Facility Location Problem (MFLP), that achieve approximation ratios of 1.861 and 1.61. Mahdian et al. combined the latter algorithm with scaling and greedy augmentation techniques, obtaining a 1.52-approximation for the MFLP. We consider a generalization of the Squared Euclidean Facility Location Problem, when the distance function i...