Covering Clients with Types and Budgets
In this paper, we consider a variant of the facility location problem. Imagine the scenario where facilities are categorized into multiple types such as schools, hospitals, post offices, etc. and the cost of connecting a client to a facility is realized by the distance between them. Each client has a total budget on the distance she/he is willing to travel. The goal is to open the minimum number of facilities such that the aggregate distance of each client to multiple types is within her/his budget. This problem closely resembles to the set cover and r-domination problems. Here, we study this problem in different settings. Specifically, we present some positive and negative results in the general setting, where no assumption is made on the distance values. Then we show that better results can be achieved when clients and facilities lie in a metric space.
Facility Location
Geometric Set Cover
Local Search
Theory of computation~Packing and covering problems
Theory of computation~Facility location and clustering
73:1-73:12
Regular Paper
PSL Project MULTIFAC
Dimitris
Fotakis
Dimitris Fotakis
Yahoo Research-New York, USA & National Technical University of Athens, Greece
Laurent
Gourvès
Laurent Gourvès
Université Paris-Dauphine, PSL University, CNRS, LAMSADE, 75016 Paris, France
Claire
Mathieu
Claire Mathieu
CNRS, France
Abhinav
Srivastav
Abhinav Srivastav
ENS Paris & Université Paris-Dauphine, France
10.4230/LIPIcs.ISAAC.2018.73
A. Ageev, Y. Ye, and J. Zhang. Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. SIAM J. Discrete Math., 18(1):207-2017, 2004.
N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor. The Online Set Cover Problem. SIAM J. Computing, 39(2):361-370, 2009.
S. Arora, N. Gupta, S. Khuller, Y. Sabharwal, and S. Singhal. Facility Location with Red-blue Demands. Operation Research Letter, 42(6):462-465, September 2014.
N. Bansal and K. Pruhs. Weighted geometric set multi-cover via quasi-uniform sampling. J. Comp. Geometry, 7(1):221-236, 2016.
R. Bar-Yehuda, G. Flysher, J. Mestre, and D. Rawitz. Approximation of Partial Capacitated Vertex Cover. SIAM J. Discrete Math., 24(4):1441-1469, 2010.
J. Byrka, S. Li, and B. Rybicki. Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties). Theory of Computing Systems, 58(1):19-44, 2016.
A. Caprara, G. F. Italiano, G. Mohan, A. Panconesi, and A. Srinivasan. Wavelength rerouting in optical networks, or the Venetian Routing problem. J. Algorithms, 45(2):93-125, 2002.
R.D. Carr, S. Doddi, G. Konjevod, and M.V. Marathe. On the red-blue set cover problem. In Proc. of SODA, pages 345-353, 2000.
I. Dinur and D. Steurer. Analytical approach to parallel repetition. In Proc. of STOC, pages 624-633, 2014.
Y. Dodis and S. Khanna. Designing Networks with Bounded Pairwise Distance. In Proc. of STOC, pages 750-759, 1999.
A. Efrat, F. Hoffmann, C. Knauer, K. Kriegel, G. Rote, and C. Wenk. Covering Shapes by Ellipses. In Proc. of SODA, pages 453-454, 2002.
M. Elkin and D. Peleg. The Hardness of Approximating Spanner Problems. Theory Comp. Systems, 41(4):691-729, 2007.
D. Fotakis. Online and Incremental Algorithms for Facility Location. SIGACT News, 42(1):97-131, 2011.
M.R. Garey and D.S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman &Co., 1990.
M. Hajiaghayi, R. Khandekar, and G. Kortsarz. Budgeted Red-blue Median and Its Generalizations. In Proc. of ESA, pages 314-325, 2010.
D.S. Hochbaum and W. Maass. Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. J. ACM, 32(1):130-136, 1985.
D.S. Hochbaum and W. Maass. Fast approximation algorithms for a nonconvex covering problem. J. Algorithms, 8(3):305-323, 1987.
K. Jain and V.V. Vazirani. An approximation algorithm for the fault tolerant metric facility location problem. In Proc. of APPROX, pages 177-183, 2000.
J. Könemann, O. Parekh, and D. Segev. A Unified Approach to Approximating Partial Covering Problems. Algorithmica, 59(4):489-509, 2011.
N.H. Mustafa and S. Ray. Improved Results on Geometric Hitting Set Problems. Discrete & Computational Geometry, 44(4):883-895, 2010.
C. Swamy and D.B. Shmoys. Fault-tolerant facility location. ACM Trans. Algorithms, 4(4):51:1-51:27, 2008.
R.R. Yager. On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans. on Systems, Man, and Cybernetics, 18(1):183-190, 1988.
Dimitris Fotakis, Laurent Gourvès, Claire Mathieu, and Abhinav Srivastav
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode