Abstract
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 sides violates both the bounds [7]. 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This doesn’t follow from the general values for any value of \(\ell \).
- 2.
If a small facility \(i'\) was closed in \(AS_{cap}\) then \(\bar{\rho }^1(j_{i'}, i') + \sum _{i \ne i'} \bar{\rho }^1(j_i, i')=\) \(n_{i'} + \sum _{i \ne i'} \bar{\rho }^c(j_{i'}, i) = n_{i'} + d_{i'} \ge \mathcal {L}\).
References
Aggarwal, A., et al.: A 3-approximation algorithm for the facility location problem with uniform capacities. Math. Program. 141(1), 527–547 (2012). https://doi.org/10.1007/s10107-012-0565-4
Ahmadian, S., Swamy, C.: Improved approximation guarantees for lower-bounded facility location. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 257–271. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38016-7_21
An, H.C., Singh, M., Svensson, O.: LP-based algorithms for capacitated facility location. In: FOCS, pp. 256–265, October 2014
Bansal, M., Garg, N., Gupta, N.: A 5-approximation for capacitated facility location. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 133–144. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33090-2_13
Byrka, J., Fleszar, K., Rybicki, B., Spoerhase, J.: Bi-factor approximation algorithms for hard capacitated k-median problems. In: SODA 2015, pp. 722–736 (2015)
Chudak, F.A., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 99–113. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48777-8_8
Friggstad, Z., Rezapour, M., Salavatipour, M.R.: Approximating connected facility location with lower and upper bounds via LP rounding. In: SWAT 2016, pp. 1:1–1:14 (2016)
Grover, S., Gupta, N., Dabas, R.: First approximation for uniform lower and upper bounded facility location problem avoiding violation in lower bounds. CoRR abs/2106.11372 (2021)
Grover, S., Gupta, N., Khuller, S., Pancholi, A.: Constant factor approximation algorithm for uniform hard capacitated knapsack median problem. In: FSTTCS, pp. 23:1–23:22 (2018)
Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. In: FOCS, p. 603 (2000)
Han, L., Hao, C., Wu, C., Zhang, Z.: Approximation algorithms for the lower-bounded k-median and its generalizations. In: Kim, D., Uma, R.N., Cai, Z., Lee, D.H. (eds.) COCOON 2020. LNCS, vol. 12273, pp. 627–639. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58150-3_51
Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: FOCS, pp. 613–623 (2000)
Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37(1), 146–188 (2000)
Li, S.: On facility location with general lower bounds. In: SODA, pp. 2279–2290 (2019)
Lim, A., Wang, F., Xu, Z.: A transportation problem with minimum quantity commitment. Transp. Sci. 40, 117–129 (2006)
Mahdian, M., Pál, M.: Universal facility location. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 409–421. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-39658-1_38
Pál, M., Tardos, E., Wexler, T.: Facility location with nonuniform hard capacities. In: FOCS, pp. 329–338 (2001)
Shmoys, D.B., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: STOC, pp. 265–274 (1997)
Svitkina, Z.: Lower-bounded facility location. ACM Trans. Algorithms 6, 1–16 (2010)
Zhang, J., Chen, B., Ye, Y.: A multiexchange local search algorithm for the capacitated facility location problem. J. Math. Oper. Res. 30, 389–403 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Gupta, N., Grover, S., Dabas, R. (2021). Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem. In: Chen, CY., Hon, WK., Hung, LJ., Lee, CW. (eds) Computing and Combinatorics. COCOON 2021. Lecture Notes in Computer Science(), vol 13025. Springer, Cham. https://doi.org/10.1007/978-3-030-89543-3_39
Download citation
DOI: https://doi.org/10.1007/978-3-030-89543-3_39
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-89542-6
Online ISBN: 978-3-030-89543-3
eBook Packages: Computer ScienceComputer Science (R0)