Tight Approximation Bounds for the Seminar Assignment Problem

详细信息    查看全文

• 关键词：General assignment ; Budgeted maximum coverage ; Seminar assignment problem
• 刊名：Lecture Notes in Computer Science
• 出版年：2017
• 出版时间：2017
• 年：2017
• 卷：10138
• 期：1
• 页码：170-182
• 丛书名：Approximation and Online Algorithms
• ISBN：978-3-319-51741-4
• 卷排序：10138

文摘

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.