Gokul Rajaraman

A Computationally Viable Numerical Gradient-based Technique for Optimal Covering Problems

The problem of optimally covering a given compact subset of $\mathbb{R}^N$ with a preassigned number $n$ of Euclidean metric balls has a long-standing history and it is well-recognized to be computationally hard. This article establishes a numerically viable algorithm for obtaining optimal covers of…