207 citations · 435 across the 12 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2011★ 19 cited
Adaptive Submodular Optimization under Matroid Constraints
Daniel Golovin, Andreas Krause
Many important problems in discrete optimization require maximization of a monotonic submodular function subject to matroid constraints. For these problems, a simple greedy algorit…
cs.DS2010★ 12 cited
The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees
Daniel Golovin
In previous work, the author introduced the B-treap, a uniquely represented B-tree analogue, and proved strong performance guarantees for it. However, the B-treap maintains complex…