Broadcasting in Heterogeneous Tree Networks with Edge Weight Uncertainty

TL;DR

This paper addresses the challenge of broadcasting in heterogeneous tree networks with uncertain edge weights by proposing an efficient algorithm to identify a minmax-regret broadcast center, ensuring robustness against worst-case scenarios.

Contribution

The paper introduces an $O(n \log n \log \log n)$-time algorithm for the minmax-regret broadcasting problem under edge weight uncertainty in heterogeneous trees.

Findings

The algorithm efficiently computes the minmax-regret broadcast center.

It handles edge weight uncertainty under the postal model.

The approach improves robustness in network broadcasting scenarios.

Abstract

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.