60 citations · 269 across the 42 of their papers we have counts for
Showing 2009 · cs.DSShow all
2 papers · 2 filters
cs.DS2009
Succinct Coverage Oracles
Ioannis Antonellis, Anish Das Sarma, Shaddin Dughmi
In this paper, we identify a fundamental algorithmic problem that we term succinct dynamic covering (SDC), arising in many modern-day web applications, including ad-serving and onl…
cs.DS2009★ 27 cited
Submodular Functions: Extensions, Distributions, and Algorithms. A Survey
Shaddin Dughmi
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems,…