Algorithms for Minimizing the Movements of Spreading Points in Linear Domains
DOI:
https://doi.org/10.57717/cgt.v4i1.21Abstract
We study a problem on spreading points. Given a set P of n points sorted on a line L and a distance value δ we wish to move the points of P along L such that the distance of any two points of P is at least δ and the maximum movement over all points of P is minimized. Using the greedy strategy, we present an O(n) time algorithm for this problem. Further, we extend our algorithm to solve (in O(n) time) the cycle version of the problem where all points of P are on a cycle C. Previously, only weakly polynomial-time algorithms were known for these problems based on linear programming (of n variables and Θ(n) constraints). In addition, we present a linear-time algorithm for another similar facility-location moving problem, which improves on previous work.
Downloads
Published
How to Cite
License
Copyright (c) 2025 Shimin Li, Haitao Wang
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
