#### Filter Results:

#### Publication Year

2015

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- STACS
- 2015

Over the past several decades there has been steady progress towards the goal of polynomial-time approximation schemes (PTAS) for fundamental geometric combinatorial optimization problems. A foremost example is the geometric hitting set problem: given a set P of points and a set D of geometric objects, compute the minimum-sized subset of P that hits all… (More)

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- Comput. Geom.
- 2016

- Norbert Bus, Nabil H. Mustafa, Saurabh Ray
- ESA
- 2015

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… (More)

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- ArXiv
- 2015

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, Bronniman and Goodrich [5] made an important connection of this problem to the size of fundamental… (More)

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- Discrete & Computational Geometry
- 2017

- Norbert Bus, Nabil H. Mustafa, Venceslas Biri
- Comput. Graph. Forum
- 2015

- ‹
- 1
- ›