Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.17271 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915035628961792 |
|---|---|
| author | Tsou, Cheng-Hsiao Lin, Ching-Chi Chen, Gen-Huey |
| author_facet | Tsou, Cheng-Hsiao Lin, Ching-Chi Chen, Gen-Huey |
| contents | A broadcasting problem in heterogeneous tree networks with edge weight uncertainty under the postal model is considered in this paper. The broadcasting problem asks for a minmax-regret broadcast center, which minimizes the worst-case loss in the objective function. Due to the presence of edge weight uncertainty, it is not easy to attack the broadcasting problem. An $O(n \log n \log \log n)$-time algorithm is proposed for solving the broadcasting problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_17271 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Broadcasting in Heterogeneous Tree Networks with Edge Weight Uncertainty Tsou, Cheng-Hsiao Lin, Ching-Chi Chen, Gen-Huey Data Structures and Algorithms A broadcasting problem in heterogeneous tree networks with edge weight uncertainty under the postal model is considered in this paper. The broadcasting problem asks for a minmax-regret broadcast center, which minimizes the worst-case loss in the objective function. Due to the presence of edge weight uncertainty, it is not easy to attack the broadcasting problem. An $O(n \log n \log \log n)$-time algorithm is proposed for solving the broadcasting problem. |
| title | Broadcasting in Heterogeneous Tree Networks with Edge Weight Uncertainty |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2411.17271 |