Geometric Hitting Sets for Disks: Theory and Practice - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Geometric Hitting Sets for Disks: Theory and Practice

Norbert Bus
Nabil Mustafa
Saurabh Ray
  • Fonction : Auteur correspondant
  • PersonId : 969304

Connectez-vous pour contacter l'auteur
NYU

Résumé

The geometric hitting set problem is one of the basic geometric com-binatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a small-sized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [6] made an important connection of this problem to the size of fundamental combinatorial structures called showing that small-sized imply approximation algorithms with correspondingly small approximation ratios. Finally, recently Agarwal-Pan [5] showed that their scheme can be implemented in near-linear time for disks in the plane. This current state-of-the-art is lacking in three ways. First, the constants in current constructions are large, so the approximation factor ends up being more than 40. Second, the algorithm uses sophisticated geometric tools and data structures with large resulting constants. Third, these have resulted in a lack of available software for fast computation of small hitting-sets. In this paper, we make progress on all three of these barriers: i) we prove improved bounds on sizes of nets, ii) design hitting-set algorithms without the use of these data-structures and finally, iii) present dnet, a public source-code module that incorporates both of these improvements to compute small-sized hitting sets and efficiently in practice.

Domaines

Informatique
Fichier principal
Vignette du fichier
hittingsetepsnets.pdf (541.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01188987 , version 1 (01-09-2015)

Identifiants

Citer

Norbert Bus, Nabil Mustafa, Saurabh Ray. Geometric Hitting Sets for Disks: Theory and Practice. 23rd European Symposium on Algorithms (ESA 2015), 2015, Patras, Greece. ⟨10.1007/978-3-662-48350-3_75⟩. ⟨hal-01188987⟩
246 Consultations
437 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More