AN EXTENSION OF THE BIPARTITE WEIGHTED MATCHING PROBLEM

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > journal & Dissertation > Item 987654321/29221

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29221

Title:	AN EXTENSION OF THE BIPARTITE WEIGHTED MATCHING PROBLEM
Authors:	HSIEH,AJ;HO,CW;FAN,KC
Contributors:	資訊工程研究所
Date:	1995
Issue Date:	2010-06-29 20:16:44 (UTC+8)
Publisher:	中央大學
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.
Relation:	PATTERN RECOGNITION LETTERS
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	518	View/Open

社群 sharing