37 citations · 64 across the 15 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DM2018
Connectivity in Random Annulus Graphs and the Geometric Block Model
Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal +1
We provide new connectivity results for {\em vertex-random graphs} or {\em random annulus graphs} which are significant generalizations of random geometric graphs. Random geometric…
cs.DS2018
Dynamic Set Cover: Improved Algorithms & Lower Bounds
Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni +2
We give new upper and lower bounds for the {\em dynamic} set cover problem. First, we give a -approximation for fully dynamic set cover in (amortized)…