Max–min dispersion on a line

Tetsuya Araki and Shin-ichi Nakano ()
Additional contact information
Tetsuya Araki: Gunma University
Shin-ichi Nakano: Gunma University

Journal of Combinatorial Optimization, 2022, vol. 44, issue 3, No 23, 1824-1830

Abstract: 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)$$ O ( ( 2 k 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)$$ 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.

Keywords: Dispersion problem; Facility location; Algorithm (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00549-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:3:d:10.1007_s10878-020-00549-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00549-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().