AN EXTENSION OF THE BIPARTITE WEIGHTED MATCHING PROBLEM

NCU Institutional Repository > 資訊電機學院 > 資訊工程研究所 > 期刊論文 > Item 987654321/29221

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29221

题名:	AN EXTENSION OF THE BIPARTITE WEIGHTED MATCHING PROBLEM
作者:	HSIEH,AJ;HO,CW;FAN,KC
贡献者:	資訊工程研究所
日期:	1995
上传时间:	2010-06-29 20:16:44 (UTC+8)
出版者:	中央大學
摘要:	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.
關聯:	PATTERN RECOGNITION LETTERS
显示于类别:	[資訊工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	480	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing