Computational complexity is studied for the problem of stabbing set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms straightâ€¦ (More)

Fast constant factor approximation algorithms are devised for a problem of intersecting a set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0, where the setâ€¦ (More)