71 citations · 337 across the 32 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012★ 1 cited
Hamming Approximation of NP Witnesses
Daniel Sheldon, Neal E. Young
Given a satisfiable 3-SAT formula, how hard is it to find an assignment to the variables that has Hamming distance at most n/2 to a satisfying assignment? More generally, consider…
cs.SI2012★ 71 cited
Maximizing the Spread of Cascades Using Network Design
Daniel Sheldon, Bistra Dilkina, Adam N. Elmachtoub +8
We introduce a new optimization framework to maximize the expected spread of cascades in networks. Our model allows a rich set of actions that directly manipulate cascade dynamics…