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…