Fast exact and approximate algorithms for k-partition and scheduling independent tasks

Abstract

Chaimovich, M., Fast exact and approximate algorithms for k-partition and scheduling independent tasks, Discrete Mathematics 114 (1993) 877103. We consider the problem of partitioning a multiset of integers into k disjoint subsets whose sums are closest to a given set of target numbers. (This can also be viewed as a problem of scheduling independent tasks… (More)
DOI: 10.1016/0012-365X(93)90358-Z

Topics

  • Presentations referencing similar topics