.png){kind=icon}
返回
Gomory-Hu Trees Over Wireless
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2022.3155176.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Gomory-Hu tree is a popular optimization algorithm that enables to efficiently find a min-cut (or equivalently, max-flow) for every pair of nodes in a graph. However, graphs cannot capture broadcasting and interference in wireless: over wireless networks we need to resort to the information-theoretical cut-set to bound the max-flow. Leveraging the submodularity of mutual information, we show that the Gomory-Hu algorithm can be used to efficiently find information-theoretic rate characterizations such as the capacity or an approximation to the capacity, over a number of network scenarios including wireless Gaussian networks and deterministic relay networks.
Keyword:
Wireless networks
Relay networks (telecommunication)
Approximation algorithms
Mutual information
Optimization
Interference
Upper bound
Gomory-Hu trees
min-cut
wireless networks
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
miRNA-451a Targets IFN Regulatory Factor 8 for the Progression of Systemic Lupus Erythematosus.png)
Inflammation
InflammationIF0
PREAI
分享收藏Relationships between Meiofaunal Biodiversity and Prokaryotic Heterotrophic Production in Different Tropical Habitats and Oceanic RegionsPLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏Need for a consensus on the methods by which to measure joint mobility and the definition of norms for hypermobility that reflect age, gender and ethnic-dependent variation: is revision of criteria for joint hypermobility syndrome and Ehlers-Danlos syndrome hypermobility type indicated?RheumatologyOAAI
RheumatologyIF0
OAAI分享收藏
查看更多内容