N. Alon, Y. Azar, G. J. Woeginger and T. Yadid, “Approximation Schemes for Scheduling on Parallel Machines,” Journal of Scheduling, Vol. 1, 1998, pp. 55-66. doi:10.1002/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J

has been cited by the following article:

• TITLE: Approximation Schemes for the 3-Partitioning Problems

  AUTHORS: Jianbo Li, Honglin Ding

  KEYWORDS: 3-partitioning Problem; Approximation Scheme

  JOURNAL NAME: Communications and Network, Vol.5 No.1B, November 7, 2013

  ABSTRACT: The 3-partitioning problem is to decide whether a given multiset of nonnegative integers can be partitioned into triples that all have the same sum. It is considerably used to prove the strong NP-hardness of many scheduling problems. In this paper, we consider four optimization versions of the 3-partitioning problem, and then present four polynomial time approximation schemes for these problems.