Tighter estimates for ∈-nets for disks

Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray

Research output: Contribution to journalArticle

Abstract

The geometric hitting set problem is one of the basic geometric combinatorial 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, Bronnimann and Goodrich [5] made an important connection of this problem to the size of fundamental combinatorial structures called ∈-nets, showing that small-sized ∈-nets imply approximation algorithms with correspondingly small approximation ratios. Very recently, Agarwal and Pan [2] showed that their scheme can be implemented in near-linear time for disks in the plane. Altogether this gives O(1)-factor approximation algorithms in Õ(n) time for hitting sets for disks in the plane. This constant factor depends on the sizes of ∈-nets for disks; unfortunately, the current state-of-the-art bounds are large - at least 24/∈ and most likely larger than 40/∈. Thus the approximation factor of the Agarwal and Pan algorithm ends up being more than 40. The best lower-bound is 2/∈, which follows from the Pach-Woeginger construction [32] for halfplanes in two dimensions. Thus there is a large gap between the best-known upper and lower bounds. Besides being of independent interest, finding precise bounds is important since this immediately implies an improved linear-time algorithm for the hitting-set problem. The main goal of this paper is to improve the upper-bound to 13.4/∈ for disks in the plane. The proof is constructive, giving a simple algorithm that uses only Delaunay triangulations. We have implemented the algorithm, which is available as a public open-source module. Experimental results show that the sizes of ∈-nets for a variety of data-sets are lower, around 9/∈.

Original languageEnglish (US)
Pages (from-to)27-35
Number of pages9
JournalComputational Geometry: Theory and Applications
Volume53
DOIs
StatePublished - Feb 1 2016

Fingerprint

Hitting Set
Approximation algorithms
Estimate
Approximation Algorithms
Geometric Optimization
Imply
Geometric object
Delaunay triangulation
Combinatorial optimization
Triangulation
Linear-time Algorithm
Approximation
Combinatorial Optimization Problem
Hits
Half-plane
Open Source
Immediately
Linear Time
Upper and Lower Bounds
Two Dimensions

Keywords

  • Delaunay triangulations
  • Disks
  • Epsilon nets
  • Hitting sets

ASJC Scopus subject areas

  • Geometry and Topology
  • Computer Science Applications
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this

Tighter estimates for ∈-nets for disks. / Bus, Norbert; Garg, Shashwat; Mustafa, Nabil H.; Ray, Saurabh.

In: Computational Geometry: Theory and Applications, Vol. 53, 01.02.2016, p. 27-35.

Research output: Contribution to journalArticle

Bus, Norbert ; Garg, Shashwat ; Mustafa, Nabil H. ; Ray, Saurabh. / Tighter estimates for ∈-nets for disks. In: Computational Geometry: Theory and Applications. 2016 ; Vol. 53. pp. 27-35.
@article{fe93edeb3eb9444aad2a32bef892a25a,
title = "Tighter estimates for ∈-nets for disks",
abstract = "The geometric hitting set problem is one of the basic geometric combinatorial 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, Bronnimann and Goodrich [5] made an important connection of this problem to the size of fundamental combinatorial structures called ∈-nets, showing that small-sized ∈-nets imply approximation algorithms with correspondingly small approximation ratios. Very recently, Agarwal and Pan [2] showed that their scheme can be implemented in near-linear time for disks in the plane. Altogether this gives O(1)-factor approximation algorithms in {\~O}(n) time for hitting sets for disks in the plane. This constant factor depends on the sizes of ∈-nets for disks; unfortunately, the current state-of-the-art bounds are large - at least 24/∈ and most likely larger than 40/∈. Thus the approximation factor of the Agarwal and Pan algorithm ends up being more than 40. The best lower-bound is 2/∈, which follows from the Pach-Woeginger construction [32] for halfplanes in two dimensions. Thus there is a large gap between the best-known upper and lower bounds. Besides being of independent interest, finding precise bounds is important since this immediately implies an improved linear-time algorithm for the hitting-set problem. The main goal of this paper is to improve the upper-bound to 13.4/∈ for disks in the plane. The proof is constructive, giving a simple algorithm that uses only Delaunay triangulations. We have implemented the algorithm, which is available as a public open-source module. Experimental results show that the sizes of ∈-nets for a variety of data-sets are lower, around 9/∈.",
keywords = "Delaunay triangulations, Disks, Epsilon nets, Hitting sets",
author = "Norbert Bus and Shashwat Garg and Mustafa, {Nabil H.} and Saurabh Ray",
year = "2016",
month = "2",
day = "1",
doi = "10.1016/j.comgeo.2015.12.002",
language = "English (US)",
volume = "53",
pages = "27--35",
journal = "Computational Geometry: Theory and Applications",
issn = "0925-7721",
publisher = "Elsevier",

}

TY - JOUR

T1 - Tighter estimates for ∈-nets for disks

AU - Bus, Norbert

AU - Garg, Shashwat

AU - Mustafa, Nabil H.

AU - Ray, Saurabh

PY - 2016/2/1

Y1 - 2016/2/1

N2 - The geometric hitting set problem is one of the basic geometric combinatorial 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, Bronnimann and Goodrich [5] made an important connection of this problem to the size of fundamental combinatorial structures called ∈-nets, showing that small-sized ∈-nets imply approximation algorithms with correspondingly small approximation ratios. Very recently, Agarwal and Pan [2] showed that their scheme can be implemented in near-linear time for disks in the plane. Altogether this gives O(1)-factor approximation algorithms in Õ(n) time for hitting sets for disks in the plane. This constant factor depends on the sizes of ∈-nets for disks; unfortunately, the current state-of-the-art bounds are large - at least 24/∈ and most likely larger than 40/∈. Thus the approximation factor of the Agarwal and Pan algorithm ends up being more than 40. The best lower-bound is 2/∈, which follows from the Pach-Woeginger construction [32] for halfplanes in two dimensions. Thus there is a large gap between the best-known upper and lower bounds. Besides being of independent interest, finding precise bounds is important since this immediately implies an improved linear-time algorithm for the hitting-set problem. The main goal of this paper is to improve the upper-bound to 13.4/∈ for disks in the plane. The proof is constructive, giving a simple algorithm that uses only Delaunay triangulations. We have implemented the algorithm, which is available as a public open-source module. Experimental results show that the sizes of ∈-nets for a variety of data-sets are lower, around 9/∈.

AB - The geometric hitting set problem is one of the basic geometric combinatorial 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, Bronnimann and Goodrich [5] made an important connection of this problem to the size of fundamental combinatorial structures called ∈-nets, showing that small-sized ∈-nets imply approximation algorithms with correspondingly small approximation ratios. Very recently, Agarwal and Pan [2] showed that their scheme can be implemented in near-linear time for disks in the plane. Altogether this gives O(1)-factor approximation algorithms in Õ(n) time for hitting sets for disks in the plane. This constant factor depends on the sizes of ∈-nets for disks; unfortunately, the current state-of-the-art bounds are large - at least 24/∈ and most likely larger than 40/∈. Thus the approximation factor of the Agarwal and Pan algorithm ends up being more than 40. The best lower-bound is 2/∈, which follows from the Pach-Woeginger construction [32] for halfplanes in two dimensions. Thus there is a large gap between the best-known upper and lower bounds. Besides being of independent interest, finding precise bounds is important since this immediately implies an improved linear-time algorithm for the hitting-set problem. The main goal of this paper is to improve the upper-bound to 13.4/∈ for disks in the plane. The proof is constructive, giving a simple algorithm that uses only Delaunay triangulations. We have implemented the algorithm, which is available as a public open-source module. Experimental results show that the sizes of ∈-nets for a variety of data-sets are lower, around 9/∈.

KW - Delaunay triangulations

KW - Disks

KW - Epsilon nets

KW - Hitting sets

UR - http://www.scopus.com/inward/record.url?scp=84961301995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84961301995&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2015.12.002

DO - 10.1016/j.comgeo.2015.12.002

M3 - Article

AN - SCOPUS:84961301995

VL - 53

SP - 27

EP - 35

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

ER -