The Analysis of the Greedy Algorithm for the Set Partition under the Core Constraint
集合核约束分划的贪婪算法分析

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.