Existence of planar support for geometric hypergraphs using elementary techniques
From MaRDI portal
Publication:2174599
DOI10.1016/j.disc.2020.111853zbMath1437.05168OpenAlexW3007434239MaRDI QIDQ2174599
Sameer Desai, Arijit Bishnu, Gopinath Mishra, Arijit Ghosh, Subhabrata Paul
Publication date: 21 April 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.111853
Cites Work
- Approximation algorithms for maximum independent set of pseudo-disks
- Improved results on geometric hitting set problems
- On the chromatic number of some geometric hypergraphs
- New existence proofs ε-nets
- Packing and Covering with Non-Piercing Regions
- Approximation Schemes for Covering and Packing
- Planar Support for Non-piercing Regions and Applications
- Coloring intersection hypergraphs of pseudo-disks
This page was built for publication: Existence of planar support for geometric hypergraphs using elementary techniques