research
∙
07/18/2022
Almost Tight Bounds for Online Facility Location in the Random-Order Model
We study the online facility location problem with uniform facility cost...
share
research
∙
05/20/2021
Approximation Algorithms for the NFV Service Distribution Problem
Distributed cloud networking builds on network functions virtualization ...
research
∙
04/12/2021
Online Weighted Bipartite Matching with a Sample
We study the classical online bipartite matching problem: One side of th...
research
∙
05/23/2020
Routing Oblivious Measurement Analytics
Network-wide traffic analytics are often needed for various network moni...
research
∙
04/25/2020
A (1-e^-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem
We study the problem of maximizing a monotone submodular function subjec...
research
∙
07/11/2019
Competitive Analysis with a Sample and the Secretary Problem
We extend the standard online worst-case model to accommodate past exper...
research
∙
07/01/2019