An O(n log n log log n)-time algorithm finds the minmax-regret broadcast center in a tree when every edge weight can vary within an interval under the postal model.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Broadcasting in Heterogeneous Tree Networks with Edge Weight Uncertainty
An O(n log n log log n)-time algorithm finds the minmax-regret broadcast center in a tree when every edge weight can vary within an interval under the postal model.