---

Combinatorial Optimization Problems In Geometric Settings arise in several areas of Network Design such as positioning of cell phone towers or other sensors to provide coverage to the area of interest. These problems can typically be formulated as some version of geometric set cover such as clustering, facility. In a non-geometric setting all these problems would typically be hard to solve. The underlying geometry can at times be exploited, however, to find efficient approximate solutions.

---

Gaurav Kanade received his PhD in computer science from the University of Iowa. His area of interest includes computational geometry, simulation and optimization. He has worked for companies like Yahoo! and Motorola and holds quite a few publications in the field of Computational Geometry.

---