Vector clock optimization via latency lengths

DOI10.1016/J.ORL.2026.107443MaRDI QIDQ7285908zbMATH OpenFDO

Authors Daniel de Roux, Da Qi Chen, R. Ravi

Publication date 22 June 2026

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2026.107443

Mathematics Subject Classification ID

Approximation algorithms (68W25) Operations research, mathematical programming (90-XX) Communication networks in operations research (90B18) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Cites work

• A Cure for the Telephone Disease
• A survey of gossiping and broadcasting in communication networks
• Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
• scientific article; zbMATH DE number 2079323 (Why is no real title available?)
• Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
• Plane gossip: approximating rumor spread in planar graphs
• Routing with Polynomial Communication-Space Trade-Off
• Second-order cone programming
• Sending secrets swiftly: approximation algorithms for generalized multicast problems
• Time, clocks, and the ordering of events in a distributed system
• Timeliness through telephones: approximating information freshness in vector clock models

This page was built for publication: Vector clock optimization via latency lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285908)