Max-Min Dispersion on a Line
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.
In this paper we give a simple O(n) time algorithm to solve the max-min version of the k-dispersion problem if P is a set of points on a line. 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.
KeywordsDispersion problem Algorithm
- 2.Akagi, T., Nakano, S.: Dispersion on the line. IPSJ SIG Technical reports, 2016-AL-158-3 (2016)Google Scholar
- 6.Cevallos, A., Eisenbrand, F., Zenklusen, R.: Max-sum diversity via convex programming. In: Proceedings of SoCG 2016, pp. 26:1–26:14 (2016)Google Scholar
- 7.Cevallos, A., Eisenbrand, F., Zenklusen, R.: Local search for max-sum diversification. In: Proceedings of SODA 2017, pp. 130–142 (2017)Google Scholar
- 9.Drezner, Z. (ed.): Facility Location: A Survey of Applications and Methods. Springer, New York (1995)Google Scholar
- 13.Frederickson, G.: Optimal algorithms for tree partitioning. In: Proceedings of SODA 1991, pp. 168–177 (1991)Google Scholar