5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2022
Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple, and Practical
Mónika Csikós, Nabil H. Mustafa
We study one of the key tools in data approximation and optimization: low-discrepancy colorings. Formally, given a finite set system , the \emph{discrepancy} of a t…
cs.CG2015★ 5 cited
Tighter Estimates for epsilon-nets for Disks
Norbert Bus, Shashwat Garg, Nabil H. Mustafa +1
The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set of points, and a set of geometric objects in the…