Year: 2024
Type: article
Abstract: For the telephone broadcast model, an $O(n\log n)$-time algorithm for constructing an optimal broadcasting scheme in a star of cliques with a total of $n$ vertices was recently presented by Ambashankar and Harutyunyan at IWOCA 2024. In the present note we give a considerably shorter and purified algorithm description and correctness proof. Moreover, we improve the time complexity to $O(n)$.
Author: Peter Damaschke
Institutions: Chalmers University of Technology, University of Gothenburg
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4403207561