%0 Journal Article
%T Efficient Fixed-parameter Enumeration Algorithm for the 3-D Matching Problem<br>3-维匹配问题的一种固定参数枚举算法
%A LIU Yun-long
%A WANG Jian-xin
%A <br>刘运龙
%A 王建新
%J 计算机科学
%D 2010
%I 
%X Enumerating a number of good solutions to a problem has an increasing demand in recented research in computational science.In this paper,we presented a fixed-parameter enumeration algorithm for the 3-D Matching problem.More precisely,we developed an algorithm that,on a given set S of n weighted triples and two integers k and z,produces z best k-matchings in time O(5.483kkn2z).Our algorithm is based on the recent improved color-coding techniques and the fixed-parameter enumeration framework.This result shows...
%K 3-D Matching
%K Fixed-parameter enumerable
%K Color-coding<br>3-维匹配问题
%K 固定参数枚举
%K 着色技术
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=382CB4A46DAF823DC210F9CF5EF7DF8F&yid=140ECF96957D60B2&vid=42425781F0B1C26E&iid=94C357A881DFC066&sid=AA27B676BFCAA4BE&eid=527AEE9F3446633A&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=10