Arpan Sadhukhan

activity

20192026

most citedAn Alternative Proof of Steinhaus Theorem

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

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2024

On Stable Approximation Algorithms for Geometric Coverage Problems

Mark de Berg, Arpan Sadhukhan

Let $P$ be a set of points in the plane and let $m$ be an integer. The goal of Max Cover by Unit Disks problem is to place $m$ unit disks whose union covers the maximum number of p…

cs.CG2021

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem

Mark de Berg, Arpan Sadhukhan, Frits Spieksma

Let $P$ be a set of points in $R^{d}$ , where each point $p \in P$ has an associated transmission range $ρ (p)$ . The range assignment $ρ$ induces a directed communication graph…