Packing, Hitting, and Colouring Squares
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914819672637440 |
|---|---|
| author | Caoduro, Marco Sebő, András |
| author_facet | Caoduro, Marco Sebő, András |
| contents | Given a finite family of squares in the plane, the packing problem asks for the maximum number $ν$ of pairwise disjoint squares among them, while the hitting problem for the minimum number $τ$ of points hitting all of them. Clearly, $τ\ge ν$. Both problems are known to be NP-hard, even for families of axis-parallel unit squares.
The main results of this work provide the first non-trivial bounds for the $τ/ ν$ ratio for not necessarily axis-parallel squares. We establish an upper bound of $6$ for unit squares and $10$ for squares of varying sizes. The worst ratios we can provide with examples are $3$ and $4$, respectively. For comparison, in the axis-parallel case, the supremum of the considered ratio is in the interval $[\frac{3}{2},2]$ for unit squares and $[\frac{3}{2},4]$ for squares of varying sizes. The methods we introduced for the $τ/ν$ ratio can also be used to relate the chromatic number $χ$ and clique number $ω$ of squares by bounding the $χ/ω$ ratio by $6$ for unit squares and $9$ for squares of varying sizes.
The $τ/ ν$ and $χ/ω$ ratios have already been bounded before by a constant for "fat" objects, the fattest and simplest of which are disks and squares. However, while disks have received significant attention, specific bounds for squares have remained essentially unexplored. This work intends to fill this gap. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2206_02185 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Packing, Hitting, and Colouring Squares Caoduro, Marco Sebő, András Computational Geometry Discrete Mathematics Combinatorics 52C15, 05B40, 05C15, 05C62, 90C27, 68W25, 68R01, 68R10 G.2.1; G.2.2 Given a finite family of squares in the plane, the packing problem asks for the maximum number $ν$ of pairwise disjoint squares among them, while the hitting problem for the minimum number $τ$ of points hitting all of them. Clearly, $τ\ge ν$. Both problems are known to be NP-hard, even for families of axis-parallel unit squares. The main results of this work provide the first non-trivial bounds for the $τ/ ν$ ratio for not necessarily axis-parallel squares. We establish an upper bound of $6$ for unit squares and $10$ for squares of varying sizes. The worst ratios we can provide with examples are $3$ and $4$, respectively. For comparison, in the axis-parallel case, the supremum of the considered ratio is in the interval $[\frac{3}{2},2]$ for unit squares and $[\frac{3}{2},4]$ for squares of varying sizes. The methods we introduced for the $τ/ν$ ratio can also be used to relate the chromatic number $χ$ and clique number $ω$ of squares by bounding the $χ/ω$ ratio by $6$ for unit squares and $9$ for squares of varying sizes. The $τ/ ν$ and $χ/ω$ ratios have already been bounded before by a constant for "fat" objects, the fattest and simplest of which are disks and squares. However, while disks have received significant attention, specific bounds for squares have remained essentially unexplored. This work intends to fill this gap. |
| title | Packing, Hitting, and Colouring Squares |
| topic | Computational Geometry Discrete Mathematics Combinatorics 52C15, 05B40, 05C15, 05C62, 90C27, 68W25, 68R01, 68R10 G.2.1; G.2.2 |
| url | https://arxiv.org/abs/2206.02185 |