  The seminar assignment problem is a variant of the generalized assignment
problem in which items have unit size and the amount of space allowed in each
bin is restricted to an arbitrary set of values. The problem has been shown to
be NP-complete and to not admit a PTAS. However, the only constant factor
approximation algorithm known to date is randomized and it is not guaranteed to
always produce a feasible solution.
  In this paper we show that a natural greedy algorithm outputs a solution with
value within a factor of $(1 - e^{-1})$ of the optimal, and that unless
$NP\subseteq DTIME(n^{\log\log n})$, this is the best approximation guarantee
achievable by any polynomial time algorithm.
