Abstract
Given a set P of n locations on which facilities can be placed and an integer k, we want to place k facilities on some locations so that a designated objective function is maximized. The problem is called the k-dispersion problem. For instance it is desirable to locate fire departments far away each other. In this paper we give a simple \(O((2k^2)^k n)\) time algorithm to solve the max–min version of the k-dispersion problem if P is a set of points on a line. If k is a constant then this is an O(n) time algorithm. This is the first O(n) time algorithm to solve the max–min k-dispersion problem for the set of “unsorted” points on a line. If P is a set of sorted points on a line, and the input is given as an array in which the coordinates of the points are stored in the sorted order, then by slightly modifying the algorithm above one can solve the dispersion problem in \(O(\log n)\) time. This is the first sublinear time algorithm to solve the max–min k-dispersion problem for the set of sorted points on a line.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agarwal P, Sharir M (1998) Efficient algorithms for geometric optimization. Comput Surv 30:412–458
Akagi T, Nakano S (2016) Dispersion on the line, IPSJ SIG Technical Reports, 2016-AL-158-3
Akagi T, Araki T, Horiyama T, Nakano S, Okamoto Y, Otachi Y, Saitoh T, Uehara R, Uno T, Wasa K (2018) Exact algorithms for the max–min dispersion problem. In: Proceedings of FAW 2018, vol 10823. LNCS, pp 263–272
Araki T, Nakano S (2018) The max–min dispersion on a line. In: Proceedings of COCOA 2018, vol 11346. LNCS, pp 672–678
Baur C, Fekete SP (1998) Approximation of geometric dispersion problems. In: Proceedings of APPROX 1998, pp 63–75
Birnbaum B, Goldman KJ (2009) An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs. Algorithmica 50:42–59
Cevallos A, Eisenbrand F, Zenklusen R (2016) Max-sum diversity via convex programming. In: Proceedings of SoCG 2016, pp 26:1–26:14
Cevallos A, Eisenbrand F, Zenklusen R (2017) Local search for max-sum diversification. In: Proceedings of SODA 2017, pp 130–142
Chandra B, Halldorsson MM (2001) Approximation algorithms for dispersion problems. J Algorithms 38:438–465
Drezner Z (1995) Facility location: a survey of applications and methods. Springer, Berlin
Drezner Z, Hamacher HW (2004) Facility location: applications and theory. Springer, Berlin
Erkut E (1990) The discrete \(p\)-dispersion problem. Eur J Oper Res 46:48–60
Fekete SP, Meijer H (2004) Maximum dispersion and geometric maximum weight cliques. Algorithmica 38:501–511
Frederickson G (1991) Optimal algorithms for tree partitioning. In: Proceedings of SODA 1991, pp 168–177
Hassin R, Rubinstein S, Tamir A (1997) Approximation algorithms for maximum dispersion. Oper Res Lett 21:133–137
Ravi SS, Rosenkrantz DJ, Tayi GK (1994) Heuristic and special case algorithms for dispersion problems. Oper Res 42:299–310
Sydow M (2014) Approximation guarantees for max sum and max min facility dispersion with parameterised triangle inequality and applications in result diversification. Math Appl 42:241–257
Tsai KH, Wang DW (1997) Optimal algorithms for circle partitioning. In: Proceedings of COCOON 1997, vol 1276. LNCS, pp 304–310
Wang DW, Kuo Y-S (1988) A study on two geometric location problems. Inf Process Lett 28:281–286
Funding
Funding was provided by Kakenhi (Grant No. 17K00003).
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.
Rights and permissions
About this article
Cite this article
Araki, T., Nakano, Si. Max–min dispersion on a line. J Comb Optim 44, 1824–1830 (2022). https://doi.org/10.1007/s10878-020-00549-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-020-00549-5