.png){kind=icon}
返回
A distributed message passing algorithm for the capacitated directed Chinese postman problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2022.107755.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Message passing is a class of extremely powerful distributed iterative algorithms based on probabilistic graphic model, in which little computation performed per iteration on minimal data structure. As a prototypical message-passing algorithm, belief propagation (BP) algorithm has wide applications in various fields of coding theory, machine learning and combinatorial optimization. Due to its distributed and iterative nature, BP algorithm can run effectively and fast on large data networks. In this paper, we study the behavior of Min-Sum BP algorithm for the capacitated directed Chinese postman problem (CDCP). We derive the iterative process of message passing for solving CDCP As the main result, for any weighted digraph G of size n, if the weight on each edge is nonnegative integral, then our algorithm converges to the optimal solution of CDCP after O(w*n(2)) iterations, provided that CDCP has a unique optimal solution, where w* = max{w(e) : e is an element of E(G)}.
Keyword:
Distributed algorithm
Message passing
Belief propagation
Capacitated directed Chinese postman problem
Combinatorial optimization
期刊
C
IF:
4.9
论文数:
6.7K
被引数:
1.3W
机构
引用论文
APIXABAN AND RIVAROXABAN VERSUS WARFARIN AS ATRIAL FIBRILLATION OR VENOUS THROMBOEMBOLISM TREATMENT IN SEVERELY OBESE PATIENTS: A MULTICENTER RETROSPECTIVE ANALYSIS阿哌沙班和利伐沙班与华法林在房颤或静脉血栓栓塞症治疗中严重肥胖患者的应用：一项多中心回顾性分析
PREAI
分享收藏Three-dimensional nanofabrication via ultrafast laser patterning and kinetically regulated material assembly通过超快激光图案化和动力学调节的材料组装进行三维纳米加工.png)
Science
OAAI
ScienceIF0
OAAI分享收藏
分享收藏
查看更多内容