Miscellaneous problems about packing and covering
G\'abor Fejes T\'oth, L\'aszl\'o Fejes T\'oth, W{\l}odzimierz, Kuperberg
TL;DR
This paper surveys various specialized problems related to packing and covering, including finite arrangements, Minkowskian packings, and stability issues, providing a comprehensive overview of current results and open questions.
Contribution
It offers a detailed survey of diverse packing and covering problems, highlighting recent developments and unresolved issues in the field.
Findings
Survey of finite arrangements and Minkowskian packings
Discussion of stability and shortest path problems
Overview of saturated and totally separable packings
Abstract
In this paper we discuss various special problems on packing and covering. Among others we survey the problems and results concerning finite arrangements, Minkowskian, saturated, compact, and totally separable packings. We discuss shortest path problems and questions about stability of packings.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Computational Geometry and Mesh Generation · Mathematics and Applications