4 citations · 15 across the 7 of their papers we have counts for
11 papers
Almost Tight Bounds for Online Facility Location in the Random-Order Model
Haim Kaplan, David Naori, Danny Raz
We study the online facility location problem with uniform facility costs in the random-order model. Meyerson's algorithm [FOCS'01] is arguably the most natural and simple online a…
Approximation Algorithms for the NFV Service Distribution Problem
Hao Feng, Jaime Llorca, Antonia M. Tulino +2
Distributed cloud networking builds on network functions virtualization (NFV) and software defined networking (SDN) to enable the deployment of network services in the form of elas…
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 Weighted Matching with a Sample
Haim Kaplan, David Naori, Danny Raz
We study the greedy-based online algorithm for edge-weighted matching with (one-sided) vertex arrivals in bipartite graphs, and edge arrivals in general graphs. This algorithm was…
Routing Oblivious Measurement Analytics
Ran Ben Basat, Xiaoqi Chen, Gil Einziger +3
Network-wide traffic analytics are often needed for various network monitoring tasks. These measurements are often performed by collecting samples at network switches, which are th…
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…