Jul 2026
Exploiting Graph Structure for Near-Optimal Broadcasting
A faster approximation algorithms that produce valid schedules for telephone broadcasting, and parameterized hardness for vertex cover above maximum matching, dominating set size, and graph diameter, indicating that FPT algorithms for these parameters are unlikely.
Rudranarayan Kar, Praneet Kumar Patra, Diya Roy et al.
· arXiv.org · 0 citations