Existence of planar support for geometric hypergraphs using elementary techniques
From MaRDI portal
Publication:2174599
DOI10.1016/J.DISC.2020.111853zbMATH Open1437.05168OpenAlexW3007434239MaRDI QIDQ2174599FDOQ2174599
Authors: Arijit Bishnu, Sameer Desai, Arijit Ghosh, Gopinath Mishra, S. 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
Recommendations
Cites Work
- New existence proofs ε-nets
- Improved results on geometric hitting set problems
- On the chromatic number of some geometric hypergraphs
- Approximation algorithms for maximum independent set of pseudo-disks
- Packing and covering with non-piercing regions
- Approximation Schemes for Covering and Packing
- Coloring intersection hypergraphs of pseudo-disks
- Planar Support for Non-piercing Regions and Applications
Cited In (1)
This page was built for publication: Existence of planar support for geometric hypergraphs using elementary techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174599)