Piercing all translates of a set of axis-parallel rectangles
From MaRDI portal
Publication:2115866
DOI10.1007/978-3-030-79987-8_21OpenAlexW3183790410MaRDI QIDQ2115866FDOQ2115866
Josef Tkadlec, Adrian Dumitrescu
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2106.07459
Cites Work
- Title not available (Why is that?)
- Research Problems in Discrete Geometry
- Title not available (Why is that?)
- Title not available (Why is that?)
- On point covers of parallel rectangles
- On point covers of multiple intervals and axis-parallel rectangles
- How to find a battleship
- Covering boxes by points
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Title not available (Why is that?)
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
- Optimal packing and covering in the plane are NP-complete
- Polynomial-time approximation schemes for packing and piercing fat objects
- Transversal numbers of translates of a convex body
- Title not available (Why is that?)
- Transversals for families of translates of a two-dimensional convex compact set
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
- Piercing translates and homothets of a convex body
- A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane
- On the dispersion of sparse grids
- A note on minimal dispersion of point sets in the unit cube
- An upper bound on the minimal dispersion
- On the size of the largest empty box amidst a point set
- On optimal piercing of a square
- Piercing axis-parallel boxes
- Improved dispersion bounds for modified Fibonacci lattices
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
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)
