Showing cs.CGShow all
2 papers · 1 filter
cs.CG2016
Faster Approximation for Maximum Independent Set on Unit Disk Graph
Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Maximum independent set from a given set of unit disks intersecting a horizontal line can be solved in time and space. As a corollary, we design a factor 2 ap…
cs.CG2016
Covering segments with unit squares
Ankush Acharyya, Subhas C. Nandy, Supantha Pandit +1
We study several variations of line segment covering problem with axis-parallel unit squares in . A set of line segments is given. The objective is to find the mi…