### Abstract

We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of points that hit all geometric objects. The problem is known to be strongly NP-hard even for simple geometric objects like unit disks in the plane. Therefore, unless P=NP, it is not possible to get Fully Polynomial Time Approximation Algorithms (FPTAS) for such problems. We give the first PTAS for this problem when the geometric objects are halfspaces in ℝ3 and when they are an r-admissible set regions in the plane (this includes pseudo-disks as they are 2-admissible). Quite surprisingly, our algorithm is a very simple local search algorithm which iterates over local improvements only.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 25th Annual Symposium on Computational Geometry, SCG'09 |

Pages | 17-22 |

Number of pages | 6 |

DOIs | |

State | Published - Dec 4 2009 |

Event | 25th Annual Symposium on Computational Geometry, SCG'09 - Aarhus, Denmark Duration: Jun 8 2009 → Jun 10 2009 |

### Publication series

Name | Proceedings of the Annual Symposium on Computational Geometry |
---|

### Other

Other | 25th Annual Symposium on Computational Geometry, SCG'09 |
---|---|

Country | Denmark |

City | Aarhus |

Period | 6/8/09 → 6/10/09 |

### Fingerprint

### Keywords

- Approximation algorithm
- Epsilon nets
- Hitting sets
- Local search

### ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics

### Cite this

*Proceedings of the 25th Annual Symposium on Computational Geometry, SCG'09*(pp. 17-22). (Proceedings of the Annual Symposium on Computational Geometry). https://doi.org/10.1145/1542362.1542367