Anirban Ghosh

activity

20122022

most citedExperiments with Unit Disk Cover Algorithms for Covering Massive Pointsets

2 citations · 2 across the 4 of their papers we have counts for

collaborators

2 papers

cs.CG2020

Sparse Hop Spanners for Unit Disk Graphs

Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth

A unit disk graph $G$ on a given set $P$ of points in the plane is a geometric graph where an edge exists between two points $p, q \in P$ if and only if $∣ pq ∣ \leq 1$ . A spanning su…

cs.CG2012

Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles

Ritankar Mandal, Anirban Ghosh, Sasanka Roy +1

Given a set $R = {R_{1}, R_{2}, ..., R_{n}}$ of $n$ randomly positioned axis parallel rectangles in 2D, the problem of computing the minimum clique cover (MCC) and maximum independe…