𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Bound on the Ratio between the Packing and Covering Densities of a Convex Body

✍ Scribed by E. H. Smith

Publisher
Springer
Year
2000
Tongue
English
Weight
122 KB
Volume
23
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A simplicial branch and duality bound al
A simplicial branch and duality bound algorithm for the sum of convex–convex ratios problem
✍ Pei-Ping Shen; Yun-Peng Duan; Yong-Gang Pei πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 601 KB

This article presents a simplicial branch and duality bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region. To our knowledge, little progress has been made for globally solving this problem so far. The algorithm uses a branch and bound scheme wh

On the Maximum Number of Touching Pairs
On the Maximum Number of Touching Pairs in a Finite Packing of Translates of a Convex Body
✍ KΓ‘roly Bezdek πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 102 KB

Minkowski space M d =(R d , || ||) is just R d with distances measured using a norm || ||. A norm || || is completely determined by its unit ball {x Β₯ R d | ||x|| [ 1} which is a centrally symmetric convex body of the d-dimensional Euclidean space E d . In this note we give upper bounds for the maxi