In a recent article, Tarnai and Gáspár used computer simulations to find thin coverings of a square with up to ten equal circles. We will give improved coverings with six and eight circles and a new, thin covering with eleven circles, found by the use of simulated annealing. Furthermore, we present a combinatorial method for constructing lower bounds for the optimal covering radius.
|Journal||Electronic journal of combinatorics|
|Publication status||Published - 1997|