论文信息 - An extension of the bipartite weighted matching problem

An extension of the bipartite weighted matching problem

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.

[1] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[2] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.

[3] Eiichi Tanaka,et al. The Tree-to-Tree Editing Problem , 1988, Int. J. Pattern Recognit. Artif. Intell..

[4] Ming S. Hung,et al. Technical Note - A Polynomial Simplex Method for the Assignment Problem , 1983, Oper. Res..

[5] Fang-Hsuan Cheng,et al. Fuzzy approach to solve the recognition problem of handwritten chinese characters , 1989, Pattern Recognit..

[6] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7] H. Kuhn. The Hungarian method for the assignment problem , 1955 .

[8] Alon Itai,et al. Some Matching Problems for Bipartite Graphs , 1978, JACM.