Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1016/0167-8655(94)00106-D | Pattern Recognition Letters |
Keywords | Field | DocType |
bipartite weighted matching,assignment problem,bipartite weighted matching problem,hungarian method | Matching pursuit,Discrete mathematics,Combinatorics,Optimal matching,Edge cover,Bipartite graph,Matching (graph theory),Assignment problem,3-dimensional matching,Blossom algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
16 | 4 | Pattern Recognition Letters |
Citations | PageRank | References |
5 | 0.64 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ai-Jia Hsieh | 1 | 23 | 2.92 |
| Chin-Wen Ho | 2 | 573 | 39.27 |
| Kuo-chin Fan | 3 | 1369 | 117.82 |