Login / Signup
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP.
Deeparnab Chakrabarty
Gagan Goel
Published in:
FOCS (2008)
Keyphrases
</>
lower bound
objective function
upper bound
greedy algorithm
online algorithms
social welfare
quadratic assignment problem
improved algorithm
branch and bound algorithm
multi class
branch and bound
resource allocation
np hard
optimal solution
high order
decision boundary
pairwise
machine learning