Presents a linear-time (1.5-ε)-approximation algorithm for the broadcast time problem on k-cycle graphs.
IEEE Transactions on ComputersC- 30(5), 363–366 (1981)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Linear-Time 1.5-Approximation for Broadcasting in k-Cycle Graphs
Presents a linear-time (1.5-ε)-approximation algorithm for the broadcast time problem on k-cycle graphs.