Abstract
We study the broadcasting of messages in the single-port, blocking communication model under edge reductions. Edge reductions model the decrease or elimination of broadcast costs on edges. Let T be an n-vertex tree and B be a target broadcast cost. We present an O(n) time algorithm for determining which edges to reduce (i.e., assign cost 0) such that the number of reduced edges is a minimum and a broadcast initiated at a vertex in a determined center set costs at most B. We present an O(n log n) time algorithm to minimize the cost of a broadcast initiated at an arbitrary vertex.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
