1 citations · 1 across the 1 of their papers we have counts for
3 papers
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…
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…
The Complexity of Scheduling for p-norms of Flow and Stretch
Benjamin Moseley, Kirk Pruhs, Cliff Stein
We consider computing optimal k-norm preemptive schedules of jobs that arrive over time. In particular, we show that computing the optimal k-norm of flow schedule, is strongly NP-h…