6 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DS2019
Approximate -Sketching of Valuation Functions
Grigory Yaroslavtsev, Samson Zhou
We study the problem of constructing a linear sketch of minimum dimension that allows approximation of a given real-valued function …
cs.DS2019
Adversarially Robust Submodular Maximization under Knapsack Constraints
Dmitrii Avdiukhin, Slobodan Mitrović, Grigory Yaroslavtsev +1
We propose the first adversarially robust algorithm for monotone submodular maximization under single and multiple knapsack constraints with scalable implementations in distributed…
cs.DS2017★ 6 cited
Optimal Parametric Search for Path and Tree Partitioning
Greg N. Frederickson, Samson Zhou
We present linear-time algorithms for partitioning a path or a tree with weights on the vertices by removing edges to maximize the minimum-weight component. We also use the sam…