1 citations · 1 across the 8 of their papers we have counts for
7 papers · 1 filter
Endpoint Covering of Axis-Parallel Segments:Bichromatic and Monochromatic One-Center
Nandana Ghosh, Ankush Acharyya, Rakesh Gupta +1
We study exact one-center optimization for axis-parallel segments using axis-parallel squares under endpoint-based coverage, where a segment is \emph{-covered} if the square con…
Hardness and Approximation Schemes for Discrete Packing and Domination
Raghunath Reddy Madireddy, Apurva Mudgal, Supantha Pandit
We present polynomial-time approximation schemes based on local search} technique for both geometric (discrete) independent set (\mdis) and geometric (discrete) dominating set (\md…
Asymmetric Separation Problem for Bichromatic Point Set
Sukanya Maji, Supantha Pandit, Sanjib Sadhu
We study the Generalized Red-Blue Annulus Cover problem for two sets of points, red () and blue (), where each point is associated with a positive penalty ${\…
Variations of largest rectangle recognition amidst a bichromatic point set
Ankush Acharyya, Minati De, Subhas C. Nandy +1
Classical separability problem involving multi-color point sets is an important area of study in computational geometry. In this paper, we study different separability problems for…
Covering and Packing of Rectilinear Subdivision
Satyabrata Jana, Supantha Pandit
We study a class of geometric covering and packing problems for bounded regions on the plane. We are given a set of axis-parallel line segments that induces a planar subdivision wi…
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…
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…