dc.contributor.author | Chudnovsky, Maria | |
dc.contributor.author | Spirkl, Sophie | |
dc.contributor.author | Zerbib, Shira | |
dc.date.accessioned | 2022-08-12 01:16:49 (GMT) | |
dc.date.available | 2022-08-12 01:16:49 (GMT) | |
dc.date.issued | 2018 | |
dc.identifier.uri | https://doi.org/10.37236/7034 | |
dc.identifier.uri | http://hdl.handle.net/10012/18533 | |
dc.description.abstract | Let F be a finite family of axis-parallel boxes in Rd such that F contains no k + 1 pairwise disjoint boxes. We prove that if F contains a subfamily M of k pairwise disjoint boxes with the property that for every F E F and M E M with F ∩ M ≠ 6= Ø, either F contains a corner of M or M contains 2d-1 corners of F, then F can be pierced by O(k) points. One consequence of this result is that if d = 2 and the ratio between any of the side lengths of any box is bounded by a constant, then F can be pierced by O(k) points. We further show that if for each two intersecting boxes in F a corner of one is contained in the other, then F can be pierced by at
most O(k log log(k)) points, and in the special case where F contains only cubes this bound improves to O(k). | en |
dc.description.sponsorship | Supported by NSF grant DMS-1550991 and US Army Research Office Grant W911NF-16-1-0404 | en |
dc.language.iso | en | en |
dc.publisher | The Electronic Journal of Combinatorics | en |
dc.subject | axis-parallel boxes | en |
dc.subject | hitting set | en |
dc.subject | piercing | en |
dc.subject | packing and covering | en |
dc.subject | matching and covering | en |
dc.title | Piercing axis-parallel boxes | en |
dc.type | Article | en |
dcterms.bibliographicCitation | Chudnovsky, M., Spirkl, S., & Zerbib, S. (2018). Piercing Axis-Parallel Boxes. The Electronic Journal of Combinatorics, P1.70-P1.70. https://doi.org/10.37236/7034 | en |
uws.contributor.affiliation1 | Faculty of Mathematics | en |
uws.contributor.affiliation2 | Combinatorics and Optimization | en |
uws.typeOfResource | Text | en |
uws.peerReviewStatus | Reviewed | en |
uws.scholarLevel | Faculty | en |