%0 Journal Article
%T The Analysis of the Greedy Algorithm for the Set Partition under the Core Constraint<br>集合核约束分划的贪婪算法分析
%A XU Lixin
%A ZHANG Yuzhong
%A <br>徐立新
%A 张玉忠
%J 系统工程理论与实践
%D 1999
%I 
%X In this paper, weanalyse the approximate performance of the greedy algorithm for the set partition in two aspects and give the upper bound of its worst case performance ratio.
%K set partition
%K greedy algorithm
%K LPT algorithm<br>集合分划
%K 贪婪算法
%K LPT算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=8F8B9DCBD2D5F241&yid=B914830F5B1D1078&vid=2A8D03AD8076A2E3&iid=E158A972A605785F&sid=28F8B56DB6BEE30E&eid=7C72DBC13F2D71EC&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=2&reference_num=5