arrow
返回

A distributed message passing algorithm for computing perfect demand matching

delete2023-09-01
delete0
PRE
AI
G
Guowei Dai
Y
Yannan Chen
Y
Yaping Mao
D
Dachuan Xu
X
Xiaoyan Zhang *
Z
Zan‐Bo Zhang
DOI:10.1016/j.jpdc.2023.04.007delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper, we consider the perfect demand matching problem (PDM) which combines aspects of the knapsack problem along with the b-matching problem. It is a generalization of the maximum weight matching problem which has been fundamental in the development of theory of computer science and operations research. This problem is NP-hard and there exists a constant c > 0 such that the problem admits no 1 + c-approximation algorithm, unless P=NP. Here, we investigate the performance of a distributed message passing algorithm called Max-sum belief propagation for computing the problem of finding the optimal perfect demand matching. As the main result, we demonstrate the rigorous theoretical analysis of the Max-sum BP algorithm for PDM, and establish that within pseudo-polynomial-time, our algorithm could converge to the optimal solution of PDM, provided that the optimal solution of its LP relaxation is unique and integral. Different from the techniques used in previous literature, our analysis is based on primal-dual complementary slackness conditions, and thus the number of iterations of the algorithm is independent of the structure of the given graph. Moreover, to the best of our knowledge, this is one of a very few instances where BP algorithm is proved correct for NP-hard problems.(c) 2023 Elsevier Inc. All rights reserved.
Keyword:
Distributed algorithm
Message passing
Belief propagation
Perfect demand matching
Linear programming dual

期刊

Journal of Parallel and Distributed Computing 封面图
Journal of Parallel and Distributed Computing
IF:
4
论文数:
3.8K
被引数:
4.8K

机构

S
south china normal university
学者数:
2.0W
论文数: 1.3W
被引数: 13
N
Nanjing Forestry University
学者数:
2.0W
论文数: 1.6W
被引数: 3.2W
Q
qinghai normal university
学者数:
1.5K
论文数: 900
被引数: 0
B
Beijing University of Technology
学者数:
2.8W
论文数: 2.1W
被引数: 2.7W
N
Nanjing Normal University
学者数:
1.7W
论文数: 1.3W
被引数: 1.9W
学者 查看更多机构
引用论文

引用论文

BIOINSPIRED NANOTHERAPEUTICS FOR TARGETED AND ENHANCED THROMBOLYSIS仿生纳米疗法用于靶向增强溶栓治疗
err2024-12-01
err0
PREAI
errDisharoon, Dante; Raghunathan, Shruti; Hu, Keren; Hernandez, Selvin; Li, Wei; Sundd, Prithu; Shavit, Jordan; Sen Gupta, Anirban
err分享
err收藏
Potassium augments growth, yield, nutrient content, and drought tolerance in mung bean (Vigna radiata L. Wilczek.)
err2024-04-23
err0
errOAAI
errMohammad Rafiqul Islam; Umakanta Sarker; Mohammad Golam Azam; Jamil Hossain; Mohammad Ashraful Alam; Riaz Ullah; Ahmed Bari; Nazmul Hossain; Ayman El Sabagh; Mohammad Sohidul Islam
err分享
err收藏
学者 查看更多内容