Paper Info
Title
Dispersing Points on Intervals.
Abstract
We consider a problem of dispersing points on disjoint intervals on a line. Given n pairwise disjoint intervals sorted on a line, we want to find a point in each interval such that the minimum pairwise distance of these points is maximized. Based on a greedy strategy, we present a linear time algorithm for the problem. Further, we also solve in linear time the cycle version of the problem where the intervals are given on a cycle.
Year
DOI
Venue
2016
10.1016/j.dam.2017.12.028
Discrete Applied Mathematics
Keywords
DocType
Volume
Dispersing points,Intervals,Lines,Cycles,Algorithms
Conference
239
Issue
ISSN
Citations 
C
0166-218X
0
PageRank 
References 
Authors
0.34
10
2
Name
Order
Citations
PageRank
Shimin Li100.34
Haitao Wang215720.13