8 citations · 39 across the 14 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016★ 4 cited
Detecting communities is hard, and counting them is even harder
Aviad Rubinstein
We consider the algorithmic problem of community detection in networks. Given an undirected friendship graph , a subset is an -…
cs.DS2016★ 1 cited
Combinatorial Prophet Inequalities
Aviad Rubinstein, Sahil Singla
We introduce a novel framework of Prophet Inequalities for combinatorial valuation functions. For a (non-monotone) submodular objective function over an arbitrary matroid feasibili…