A Packing Inequality for Compact Convex Subsets of the Plane
From MaRDI portal
Publication:5583664
DOI10.4153/CMB-1969-096-7zbMath0189.22903OpenAlexW2047822969MaRDI QIDQ5583664
J. H. Folkman, Ronald L. Graham
Publication date: 1969
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-1969-096-7
Related Items
Competitive self-stabilizing \(k\)-clustering, A NEW PROOF FOR ZASSENHAUS–GROEMER–OLER INEQUALITY, Packings of equal disks in a square torus, The smallest convex \(k\)-gon containing \(n\) congruent disks, Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4, and 5, An inequality on the edge lengths of triangular meshes, Beurling-type density criteria for system identification, A counterpart to Oler's lattice‐point theorem, Maximizing the sum of radii of balls inscribed in a polyhedral set, Penny-packing and two-dimensional codes, The densest packing of equal circles into a parallel strip, Minimum perimeter rectangles that enclose congruent non-overlapping circles, Linear models for the approximate solution of the problem of packing equal circles into a given domain
