PhD Seminar • Algorithms and Complexity • Dispersion on Intervals: A Geometric Approach
Please note: This PhD seminar will take place online.
Anurag Murty Naredla, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Anna Lubiw
In the dispersion problem for ordered intervals, the input is an ordered list of intervals on the real line, and the task is to select one point from each interval, such that the ordering of points along the line respects the given ordering of intervals and such that the points are “far apart” from each other.