
Title: Fractal Dimension and Lower Bounds for Geometric Problems
Speaker: Kritika Singhal (Ohio State University)
Abstract: It is well known that computational complexity of geometric problems increases with the ambient dimension of the input pointset. In this talk, I will describe how fractal dimension affects computational complexity. I will discuss in detail the computation of lower bounds on the running time of the Euclidean TSP Problem and the Independent set of unit balls problem on fractal pointsets.
Seminar URL: http://mgsa.osu.edu