Lower bounds and modified LPT algorithm for k-partitioning problems with partition matroid constraint

摘要

In this paper,the k-partitioning problem with partition matroid constraint is consid- ered.LPT algorithm is modified to fit the problem and its worst-case performance is analyzed. The lower bounds of optimal solution for the min-max problem are given.