Given $n$ points on a line or closed cycle and a threshold $r>0$, the connectivity-maintenance problem is to move the points so that every gap between consecutive points is at most $r$, whereas the points-spreading problem requires every gap to be at least $r$. Li and Wang [CCCG 2015; CGT 2025] and Chen, Gu, Li, and Wang [SWAT 2012; DCG 2013] gave $O(n)$-time algorithms for the cyclic versions of min-max points-spreading and min-max connectivity-maintenance, respectively. Ghadiri and Yazdanbod [CCCG 2016] gave an $O(n\log n)$-time algorithm for the linear version of min-sum points-spreading. In this paper, we show that the two problems can be reduced in linear time to each other for both objectives and on both linear and cyclic domains. As an implication, min-sum connectivity-maintenance is solvable in $O(n\log n)$ time on both domains. Finally, we extend the reduction to points on a line with individual thresholds when their initial order is preserved.

翻译：暂无翻译