Covering boxes by points
In Euclidean \(d\)-space let \({\mathcal F}\) denote a family of closed orthotopes (the generalizations of the rectangle and the ``box) with edges parallel to the coordinate axes. Let \(\nu({\mathcal F})\) denote the maximal number of pairwise disjoint members of \({\mathcal F}\) and \(\tau({\mathcal F})\) denote the minimal number of points in a set meeting all members of \({\mathcal F}\). The paper contributes new information about the numbers \(f(n,d)= \max_{\nu({\mathcal F}) \leq n} \tau({\mathcal F})\), for example: \(f(2,d) \leq d+1\) with equality for \(d=2, 3,4;\) \(f(2,d) \geq c'\sqrt d/ \log d\); \(f(3,2)=5\); \(f(4,2) \leq 8\); \(f(n,2) \leq n \log_ 2n+2-{n \over 2}\).
- Construction of minimal bracketing covers for rectangles
- Separating pairs of points of standard boxes
- How many atoms can be defined by boxes ?
- An extremal problem of orthants containing at most one point besides the origin
- Minimal 2-fold coverings of \({\mathbf E}^ d\)
- Fast stabbing of boxes in high dimensions
- Piercing axis-parallel boxes
- Containment problems in high-dimensional spaces
- On point covers of multiple intervals and axis-parallel rectangles
- On Wegner's inequality for axis-parallel rectangles
- Piercing all translates of a set of axis-parallel rectangles
- From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem
- Covering the 3-dimensional unit cube by six rectangular boxes
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- Transversal numbers of translates of a convex body
- Covering a set of points by two axis-parallel boxes
- Covering the d-dimensional unit cube by n rectangular boxes of smaller diameter
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve
- Enclosing many boxes by an optimal pair of boxes
- From a \((p,2)\)-theorem to a tight \((p,q)\)-theorem
- Gallai-type results for multiple boxes and forests
- On point covers of c-oriented polygons
- Lower bounds for piercing and coloring boxes
- Piercing all translates of a set of axis-parallel rectangles
- Piercing translates and homothets of a convex body
- Stabbing boxes with finitely many axis-parallel lines and flats
- Transversals to colorful intersecting convex sets
- Coloring the complements of intersection graphs of geometric figures
- Intersection of parallelepipeds in \(\mathbb R^d\)
This page was built for publication: Covering boxes by points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687139)
