Existence of planar support for geometric hypergraphs using elementary techniques
From MaRDI portal
Publication:2174599
Recommendations
Cites work
- Approximation Schemes for Covering and Packing
- Approximation algorithms for maximum independent set of pseudo-disks
- Coloring intersection hypergraphs of pseudo-disks
- Improved results on geometric hitting set problems
- New existence proofs ε-nets
- On the chromatic number of some geometric hypergraphs
- Packing and covering with non-piercing regions
- Planar Support for Non-piercing Regions and Applications
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)