Finding broadcast 2-centers of a tree under the postal model
From MaRDI portal
Publication:6585258
DOI10.1016/j.dam.2024.05.035zbMATH Open1545.90044MaRDI QIDQ6585258
Chan-Hung Hsu, Ching-Chi Lin, Cheng-Hsiao Tsou
Publication date: 9 August 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- On broadcasting in unicyclic graphs
- Minimum \(k\)-broadcast graphs
- The complexity of broadcasting in planar and decomposable graphs
- The broadcast median problem in heterogeneous postal model
- Broadcasting on paths and cycles
- Sublogarithmic approximation for telephone multicast
- k-Broadcasting in trees
- Nonadaptive broadcasting in trees
- Broadcasting in Heterogeneous Tree Networks with Uncertainty
- Fast broadcasting and gossiping in radio networks
- Randomized broadcast in networks
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- A survey of gossiping and broadcasting in communication networks
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Information Dissemination in Trees
- Broadcasting in Trees with Multiple Originators
- Broadcasting in Bounded Degree Graphs
- Multiple message broadcasting in the postal model
- The absolute center of a network
- Approximation Algorithms for Minimum-Time Broadcast
- Broadcasting with universal lists
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees
- A linear algorithm for finding the k‐broadcast center of a tree
- Information dissemination in trees with nonuniform edge transmission times
- Optimal broadcasting with universal lists based on competitive analysis*
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Broadcasting in weighted trees under the postal model
- Broadcasting in split graphs
This page was built for publication: Finding broadcast 2-centers of a tree under the postal model
