DeepAI

# Covering and packing with homothets of limited capacity

This work revolves around the two following questions: Given a convex body C⊂ℝ^d, a positive integer k and a finite set S⊂ℝ^d (or a finite Borel measure μ on ℝ^d), how many homothets of C are required to cover S if no homothet is allowed to cover more than k points of S (or have measure larger than k)? How many homothets of C can be packed if each of them must cover at least k points of S (or have measure at least k)? We prove that, so long as S is not too degenerate, the answer to both questions is Θ_d(|S|/k), where the hidden constant is independent of d. This is optimal up to a multiplicative constant. Analogous results hold in the case of measures. Then we introduce a generalization of the standard covering and packing densities of a convex body C to Borel measure spaces in ℝ^d and, using the aforementioned bounds, we show that they are bounded from above and below, respectively, by functions of d. As an intermediate result, we give a simple proof the existence of weak ϵ-nets of size O(1/ϵ) for the range space induced by all homothets of C. Following some recent work in discrete geometry, we investigate the case d=k=2 in greater detail. We also provide polynomial time algorithms for constructing a packing/covering exhibiting the Θ_d(|S|/k) bound mentioned above in the case that C is an Euclidean ball. Finally, it is shown that if C is a square then it is NP-hard to decide whether S can be covered using |S|/4 squares containing 4 points each.

06/25/2018

### Maximum Area Axis-Aligned Square Packings

Given a point set S={s_1,... , s_n} in the unit square U=[0,1]^2, an anc...
08/23/2017

### Min-Max Theorems for Packing and Covering Odd (u,v)-trails

We investigate the problem of packing and covering odd (u,v)-trails in a...
09/01/2021

### Moving intervals for packing and covering

We study several problems on geometric packing and covering with movemen...
04/27/2021

### There is no APTAS for 2-dimensional vector bin packing: Revisited

We study vector bin packing and vector bin covering problems, multidimen...
09/19/2018

### Covering and Packing of Rectilinear Subdivision

We study a class of geometric covering and packing problems for bounded ...
12/28/2020

### Minoration via Mixed Volumes and Cover's Problem for General Channels

We propose a method for establishing lower bounds on the supremum of pro...
04/13/2019

### Online Bin Covering with Limited Migration

Semi-online models where decisions may be revoked in a limited way have ...