Finding broadcast 2-centers of a tree under the postal model

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(n log n)-time algorithm for solving this problem. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.