32 citations · 32 across the 4 of their papers we have counts for
7 papers
Competitive Algorithms for Block-Aware Caching
Christian Coester, Roie Levin, Joseph +2
We study the block-aware caching problem, a generalization of classic caching in which fetching (or evicting) pages from the same block incurs the same cost as fetching (or evictin…
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 -Taxi via Double Coverage and Time-Reverse Primal-Dual
Niv Buchbinder, Christian Coester, Joseph +1
We consider the online -taxi problem, a generalization of the -server problem, in which servers are located in a metric space. A sequence of requests is revealed one by o…
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…
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…
Tight Bounds for Online Weighted Tree Augmentation
Joseph, Naor, Seeun William Umboh +1
The Weighted Tree Augmentation problem (WTAP) is a fundamental problem in network design. In this paper, we consider this problem in the online setting. We are given an -vertex…