Abstract
In this paper, we study restricted variations of the following obnoxious facility location problem in the plane: locate k new obnoxious facilities amidst n ordered demand points (existing facility sites) in the plane so that none of the existing facility sites are affected. We study this problem in two restricted settings. The obnoxious facilities are constrained to be centered on (i) a predetermined horizontal line segment \({\overline{pq}}\), and (ii) the boundary arc of a predetermined disk \({{\mathcal {C}}}\). For the problem in (i), we first give an \((1-\epsilon )\)-approximation algorithm that runs in \(O\left( (n+k)\log {\frac{||pq||}{2(k-1)\epsilon }}\right) \) time, where \(\epsilon >0\) and ||pq|| is the length of \({\overline{pq}}\). We then propose two exact polynomial time algorithms, one based on doing binary search on all candidates and the other with the parametric search technique of Megiddo (J ACM 30:852–865, 1983); that will take \(O\left( (nk)^2 \right) \) time and \(O\left( (n+k)^2 \right) \) time respectively. Continuing further, using the improved parametric technique, we give an \(O(n\log {n})\)-time algorithm for \(k=2\). We also show that the \((1-\epsilon )\)-approximation algorithm of (i) can be easily adapted to solve the problem (ii) with an extra multiplicative factor of n in the running time. Finally, we give a \(O(n^3k)\)-time dynamic programming solution to the min-sum obnoxious facility location problem restricted to a line segment where the demand points are associated with weights, and the goal is to minimize the sum of the weights of the points covered.
Similar content being viewed by others
References
Abravaya, S., Segal, M.: Maximizing the number of obnoxious facilities to locate within a bounded region. Computers & operations research 37(1), 163–171 (2010)
Agarwal, P.K., Sharir, M., Toledo, S.: Applications of parametric searching in geometric optimization. J. Algorithms 17(3), 292–318 (1994)
Bae, S.W., Baral, A., Mahapatra, P.R.S.: Maximum-width empty square and rectangular annulus. Comput. Geom. 96, 101747 (2021)
Church, R.L., Drezner, Z.: Review of obnoxious facilities location problems. Computers & Operations Research 138, 105468 (2022)
Church, R.L., Garfinkel, R.S.: Locating an obnoxious facility on a network. Transp. Sci. 12(2), 107–118 (1978)
Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1), 200–208 (1987)
Colmenar, J.M., Greistorfer, P., Martí, R., Duarte, A.: Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem. Eur. J. Oper. Res. 252(2), 432–442 (2016)
Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C.: Introduction to algorithms. 3rd edn. MIT press (2009)
Díaz-Báñez, J.M., Hurtado, F., Meijer, H., Rappaport, D., Sellarès, J.A.: The largest empty annulus problem. International Journal of Computational Geometry & Applications 13(04), 317–325 (2003)
Drezner, Z., Wesolowsky, G.O.: Finding the circle or rectangle containing the minimum weight of points. Locat. Sci. 2(2), 83–90 (1994)
Drezner, Z., Wesolowsky, G.: O,: Obnoxious facility location in the interior of a planar network. J. Reg. Sci. 35, 675–688 (1995)
Frederickson, G., Johnson, D.: Generalized selection and ranking: sorted matrices. SIAM Journal of Computing 13, 14–30 (1984)
Gokalp, O.: An iterated greedy algorithm for the obnoxious \(p\)-median problem. Eng. Appl. Artif. Intell. 92, 103674 (2020)
Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130–136 (1985)
Katz, M.J., Kedem, K., Segal, M.: Improved algorithms for placing undesirable facilities. Computers & Operations Research 29, 1859–1872 (2002)
Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30(4), 852–865 (1983)
Michael, S.: Placing an obnoxious facility in geometric networks. Nordic Journal of Computing 10(3), 224–237 (2003)
Qin, Z., Xu, Y., Zhu, B.: On Some Optimization Problems in Obnoxious Facility Location. In: Du, D.Z., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds.) COCOON 2000, LNCS, vol. 1858, pp. 320–329. Springer, Heidelberg (2000)
Tamir, A.: Obnoxious facility location on graphs. Transp. Sci. 4(4), 550–567 (1991)
Singireddy, V. R., Basappa, M.: Constrained Obnoxious Facility Location on a Line Segment. In: Proceedings of the 33rd Canadian Conference on Computational Geometry, 362–367, Halifax (2021)
Singireddy, V. R., Basappa, M.: Dispersing Facilities on Planar Segment and Circle Amidst Repulsion. In: Proceedings of the 18th International Symposium on Algorithmics of Wireless Networks (ALGOSENSORS 2022), Potsdam, Germany, Sep 8–9, LNCS 13707, pp. 138–151 (2022)
Acknowledgements
The authors thank the handling editor and anonymous reviewer for their helpful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Preliminary versions of this work appeared in CCCG 2021 [20] and ALGOSENSORS 2022 [21].
This work is partially supported by the Science and Engineering Research Board (SERB), Govt. of India, under Sanction Order No. TAR/2022/000397.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Singireddy, V.R., Basappa, M. Dispersing facilities on planar segment and circle amidst repulsion. J Glob Optim 88, 233–252 (2024). https://doi.org/10.1007/s10898-023-01303-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-023-01303-x