Optimal substructures in optimal and approximate circle packings

Péter Gábor Szabó

Abstract: This paper deals with the densest packing of equal circles in a square problem. Sharp bounds for the density of optimal circle packings have given. Several known optimal and approximate circle packings contain optimal substructures. Based on this observation it is sometimes easy to determine the minimal polynomials of the arrangements.