Skip to main content
1 vote

A variant of the generalised assignment problem

OP's problem generalizes the maximum coverage problem, a well-studied problem for which the best poly-time approximation ratio possibly is $1-1/e$, unless P=NP. So achieving a better ratio for OP's ...
Neal Young's user avatar
  • 10.8k

Only top scored, non community-wiki answers of a minimum length are eligible