Piercing all translates of a set of axis-parallel rectangles
From MaRDI portal
(Redirected from Publication:2115866)
Cites work
- A note on minimal dispersion of point sets in the unit cube
- A variant of the Hadwiger-Debrunner (p,q)-problem in the plane
- An upper bound on the minimal dispersion
- Covering boxes by points
- How to find a battleship
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- scientific article; zbMATH DE number 2209723 (Why is no real title available?)
- scientific article; zbMATH DE number 3199823 (Why is no real title available?)
- Improved dispersion bounds for modified Fibonacci lattices
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- On optimal piercing of a square
- On point covers of multiple intervals and axis-parallel rectangles
- On point covers of parallel rectangles
- On the dispersion of sparse grids
- On the size of the largest empty box amidst a point set
- Optimal packing and covering in the plane are NP-complete
- Piercing axis-parallel boxes
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Piercing translates and homothets of a convex body
- Polynomial-time approximation schemes for packing and piercing fat objects
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
- Research Problems in Discrete Geometry
- Small-size -nets for axis-parallel rectangles and boxes
- Transversal numbers of translates of a convex body
- Transversals for families of translates of a two-dimensional convex compact set
This page was built for publication: Piercing all translates of a set of axis-parallel rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115866)
