5 citations · 7 across the 3 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2018★ 2 cited
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 straight line segments on the plane with the smallest cardinality set of disks of fixed radii where the s…
cs.CG2016★ 5 cited
Stabbing line segments with disks: complexity and approximation algorithms
Konstantin Kobylkin
Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii…