Practical and efficient algorithms for the geometric hitting set problem

Norbert Bus, 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. Recently Agarwal and Pan (2014) presented a near-linear time algorithm for the case where D consists of disks in the plane. The algorithm uses sophisticated geometric tools and data structures with large resulting constants. In this paper, we design a hitting-set algorithm for this case without the use of these data-structures, and present experimental evidence that our new algorithm has near-linear running time in practice, and computes hitting sets within 1.3-factor of the optimal hitting set. We further present dnet, a public source-code module that incorporates this improvement, enabling fast and efficient computation of small-sized hitting sets in practice.

Original languageEnglish (US)
Pages (from-to)25-32
Number of pages8
JournalDiscrete Applied Mathematics
Volume240
DOIs
StatePublished - May 11 2018

Fingerprint

Hitting Set
Efficient Algorithms
Data structures
Data Structures
Combinatorial optimization
Geometric Optimization
Geometric object
Linear-time Algorithm
Combinatorial Optimization Problem
Hits
Linear Time
Module
Subset

Keywords

  • Approximation algorithms
  • Computational geometry
  • Geometric hitting sets

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Practical and efficient algorithms for the geometric hitting set problem. / Bus, Norbert; Mustafa, Nabil H.; Ray, Saurabh.

In: Discrete Applied Mathematics, Vol. 240, 11.05.2018, p. 25-32.

Research output: Contribution to journalArticle

@article{e87d1fcab83d43adb65d4b8d952b3d1d,
title = "Practical and efficient algorithms for the geometric hitting set problem",
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. Recently Agarwal and Pan (2014) presented a near-linear time algorithm for the case where D consists of disks in the plane. The algorithm uses sophisticated geometric tools and data structures with large resulting constants. In this paper, we design a hitting-set algorithm for this case without the use of these data-structures, and present experimental evidence that our new algorithm has near-linear running time in practice, and computes hitting sets within 1.3-factor of the optimal hitting set. We further present dnet, a public source-code module that incorporates this improvement, enabling fast and efficient computation of small-sized hitting sets in practice.",
keywords = "Approximation algorithms, Computational geometry, Geometric hitting sets",
author = "Norbert Bus and Mustafa, {Nabil H.} and Saurabh Ray",
year = "2018",
month = "5",
day = "11",
doi = "10.1016/j.dam.2017.12.018",
language = "English (US)",
volume = "240",
pages = "25--32",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",

}

TY - JOUR

T1 - Practical and efficient algorithms for the geometric hitting set problem

AU - Bus, Norbert

AU - Mustafa, Nabil H.

AU - Ray, Saurabh

PY - 2018/5/11

Y1 - 2018/5/11

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. Recently Agarwal and Pan (2014) presented a near-linear time algorithm for the case where D consists of disks in the plane. The algorithm uses sophisticated geometric tools and data structures with large resulting constants. In this paper, we design a hitting-set algorithm for this case without the use of these data-structures, and present experimental evidence that our new algorithm has near-linear running time in practice, and computes hitting sets within 1.3-factor of the optimal hitting set. We further present dnet, a public source-code module that incorporates this improvement, enabling fast and efficient computation of small-sized hitting sets in practice.

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. Recently Agarwal and Pan (2014) presented a near-linear time algorithm for the case where D consists of disks in the plane. The algorithm uses sophisticated geometric tools and data structures with large resulting constants. In this paper, we design a hitting-set algorithm for this case without the use of these data-structures, and present experimental evidence that our new algorithm has near-linear running time in practice, and computes hitting sets within 1.3-factor of the optimal hitting set. We further present dnet, a public source-code module that incorporates this improvement, enabling fast and efficient computation of small-sized hitting sets in practice.

KW - Approximation algorithms

KW - Computational geometry

KW - Geometric hitting sets

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

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

U2 - 10.1016/j.dam.2017.12.018

DO - 10.1016/j.dam.2017.12.018

M3 - Article

AN - SCOPUS:85040735765

VL - 240

SP - 25

EP - 32

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -