𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Finite Packing and Covering

✍ Scribed by Boroczky K.


Year
2004
Tongue
English
Leaves
390
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


BΓΆrΓΆczky (Hungarian Academy of Sciences) builds from the foundation set by TΓ³th (Regular Figures) and Rogers (Packing and Covering) by describing arrangements of congruent convex bodies that either form a packing in a convex container or cover a convex shape, covering arrangements in dimension two (including congruent domains in the Euclidean plane, translative arrangements, parametric density, and packings and coverings of circular discs) and arrangements in higher dimensions, including packings and coverings by spherical and unit balls, and congruent convex bodies. Appendices clarify such issues as spherical space and hyperbolic space, surfaces of constant curvature, and "a little bit of probability."


πŸ“œ SIMILAR VOLUMES


Finite Packing and Covering
✍ Jr, Karoly Boroczky πŸ“‚ Library πŸ“… 2004 πŸ› Cambridge University Press 🌐 English

This book provides an in-depth, state-of-the-art discussion of the theory of finite packings and coverings by convex bodies. It contains various new results and arguments, collects other key data scattered about the literature, and provides a comprehensive treatment of problems whose interplay was n

Finite Packing and Covering
✍ KΓ‘roly BΓΆrΓΆczky Jr πŸ“‚ Library πŸ“… 2004 πŸ› Cambridge University Press 🌐 English

This book provides an in-depth, state-of-the-art discussion of the theory of finite packings and coverings by convex bodies. It contains various new results and arguments, collects other key data scattered about the literature, and provides a comprehensive treatment of problems whose interplay was n

Packing and covering
✍ C. A. Rogers πŸ“‚ Library πŸ“… 2008 πŸ› Cambridge University Press 🌐 English
Combinatorial Optimization: Packing and
✍ GΓ©rard CornuΓ©jols πŸ“‚ Library πŸ“… 1987 πŸ› Society for Industrial Mathematics 🌐 English

This monograph presents new and elegant proofs of classical results and makes difficult results accessible. The integer programming models known as set packing and set covering have a wide range of applications. Sometimes, owing to the special structure of the constraint matrix, the natural line