In the facility location problem, we are given a set of clients and a set of candidate sites, the objective is to open facilities at some of the candidate sites so that every client can get service from at least one of the facilities opened. Facility location problems, when considered in the Euclidean plane, can be modeled as several variants of geometric disk cover problems. Most of these problems are NP- hard. The objective in the geometric disk cover problem is to find an optimal set of geometric objects that covers other geometric objects. In this talk, I will present some variants of geometric disk cover problems which model facility location problems and discuss approximation algorithms for them
Dr. Manjanna B obtained a PhD in Computer Science from Indian Institute of Technology Guwahati, India in 2016 and graduated with a Masters in Computer Science and Engineering from National Institute of Technology Karnataka, Surathkal, India in 2011. His research interests are Algorithms and Computational Geometry. Currently, he is working as an Assistant Professor in the School of Computer Science and Engineering at VIT University, Vellore, India.