Efficient constant factor approximation algorithms for stabbing line segments with equal disks

Konstantin Kobylkin

An NP-hard problem is considered of intersecting a given set of $n$ straight line segments on the plane with the smallest cardinality set of disks of fixed radii $r>0,$ where the s…