4 citations · 15 across the 7 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.NI2021★ 1 cited
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…
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
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…