An extension of the bipartite weighted matching problem

Ai Jia Hsieh, Chin Wen Ho, Kuo Chin Fan

研究成果: 雜誌貢獻期刊論文同行評審

7 引文 斯高帕斯(Scopus)

摘要

An extension of the bipartite weighted matching problem is considered in this paper. Given the weight of each edge and the penalty of each vertex, the matching goal is to find a matching such that the sum of the weights of matching edges plus the penalties of unmatched vertices is minimum. In this paper, a reduction algorithm is proposed, which is found to be capable of reducing the matching problem to the assignment problem.

原文???core.languages.en_GB???
頁(從 - 到)347-353
頁數7
期刊Pattern Recognition Letters
16
發行號4
DOIs
出版狀態已出版 - 4月 1995

引用此