Approximation algorithms for the two-center problem of convex polygon

Sanjib Sadhu, Sasanka Roy, Soumen Nandi +2

Given a convex polygon $P$ with $n$ vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover $P$. We propose an algo…