20 citations · 28 across the 9 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.GT2018★ 1 cited
Fast Algorithms for Knapsack via Convolution and Prediction
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin +1
The \Problem{knapsack} problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is o…
cs.DS2018
Submodular Secretary Problem with Shortlists
Shipra Agrawal, Mohammad Shadravan, Cliff Stein
In submodular -secretary problem, the goal is to select items in a randomly ordered input so as to maximize the expected value of a given monotone submodular function on the…