#### Filter Results:

#### Publication Year

2015

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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)

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)

- Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez, Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen +243 others
- 2016

broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not… (More)

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)

- ‹
- 1
- ›