7 citations · 9 across the 12 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
General Knapsack Problems in a Dynamic Setting
Yaron Fairstein, Ariel Kulik, Joseph +2
The world is dynamic and changes over time, thus any optimization problem used to model real life problems must address this dynamic nature, taking into account the cost of changes…
cs.DS2021
A Refined Analysis of Submodular Greedy
Ariel Kulik, Roy Schwartz, Hadas Shachnai
Many algorithms for maximizing a monotone submodular function subject to a knapsack constraint rely on the natural greedy heuristic. We present a novel refined analysis of this gre…