K-Center is a well known optimization problem that is inspired by facility location and clustering. For more than three decades, researchers have studied algorithms for computing approximately optimal solutions for variations of this problem. We will discuss some of these variants, focusing on the algorithmic approaches that have been employed.

Research Interests

In principle, all of theoretical computer science. In practice, a subset that includes primarily parts of computational geometry, but also optimization problems on graphs and the like and polynomial time computability of equilibria in games and some economic models.