4 citations · 10 across the 4 of their papers we have counts for
5 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…
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…
Competitive Analysis with a Sample and the Secretary Problem
Haim Kaplan, David Naori, Danny Raz
We extend the standard online worst-case model to accommodate past experience which is available to the online player in many practical scenarios. We do this by revealing a random…
Online Multidimensional Packing Problems in the Random-Order Model
David Naori, Danny Raz
We study online multidimensional variants of the generalized assignment problem which are used to model prominent real-world applications, such as the assignment of virtual machine…
Stochastic Service Placement
Galia Shabtai, Danny Raz, Yuval Shavitt
Resource allocation for cloud services is a complex task due to the diversity of the services and the dynamic workloads. One way to address this is by overprovisioning which result…