1 citations · 2 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
Online Virtual Machine Allocation with Predictions
Niv Buchbinder, Yaron Fairstein, Konstantina Mellou +3
The cloud computing industry has grown rapidly over the last decade, and with this growth there is a significant increase in demand for compute resources. Demand is manifested in t…
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping
Yaron Fairstein, Ariel Kulik, Hadas Shachnai
A multiple knapsack constraint over a set of items is defined by a set of bins of arbitrary capacities, and a weight for each of the items. An assignment for the constraint is an a…
An Almost Optimal Approximation Algorithm for Monotone Submodular Multiple Knapsack
Yaron Fairstein, Ariel Kulik, Joseph +3
We study the problem of maximizing a monotone submodular function subject to a Multiple Knapsack constraint. The input is a set of items, each has a non-negative weight, and a…