Abstract
In this paper, we delve into the investigation of locating broadcast 2-centers of a tree T under the postal model. The problem asks to deploy two broadcast centers so that the maximum communication time from the centers to their corresponding vertices is minimized. The broadcast 2-center problem explored in this study is essentially an extension of the classical 2-center problem. To efficiently address this challenge, we employ the binary search method, which enables us to present a highly effective O(nlogn)-time algorithm for solving this problem.
Sign-in/Register to access full text options 
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.
