Learn More
We investigated an increase in the number of patient specimens yielding Mycobacterium terrae in 1986, isolation of M. terrae was associated with specimens obtained from inpatients at our new hospital, but not with specimens referred from other hospitals [37(+)/144 inpatient specimens versus 2(+)/26 referred specimens, p less than 0.05]. By October 31, 1987,(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 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)
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)
  • 1