2 papers
cs.SI2021
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models
Da Qi Chen, Lin An, Aidin Niaparast +2
We consider an information dissemination problem where the root of an undirected graph constantly updates its information. The goal is to keep every other node in the graph about t…
cs.LG2020
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing
Thomas Lavastida, Benjamin Moseley, R. Ravi +1
We propose a new model for augmenting algorithms with predictions by requiring that they are formally learnable and instance robust. Learnability ensures that predictions can be ef…