Back to Results
First PageMeta Content
Complexity classes / Approximation algorithms / NP-complete problems / Matroid theory / Generalized assignment problem / Knapsack problem / Submodular set function / APX / Polynomial-time approximation scheme / Theoretical computer science / Computational complexity theory / Applied mathematics


All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T
Add to Reading List

Document Date: 2013-01-05 09:50:09


Open Document

File Size: 472,33 KB

Share Result on Facebook
UPDATE