In this paper, the k-partitioning problem with partition matroid constraint is considered. LPT algorithm is modified to fit the problem and its worst-ease performance is analyzed. The lower bounds of optimal solution ...In this paper, the k-partitioning problem with partition matroid constraint is considered. LPT algorithm is modified to fit the problem and its worst-ease performance is analyzed. The lower bounds of optimal solution for the min-max problem are given.展开更多
基金Supported by the National Natural Science Foundation of China(10671177)
文摘In this paper, the k-partitioning problem with partition matroid constraint is considered. LPT algorithm is modified to fit the problem and its worst-ease performance is analyzed. The lower bounds of optimal solution for the min-max problem are given.
