An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem.

Christos Kalaitzis

Published in: CoRR (2015)

Keyphrases

polynomial time approximation
approximation guarantees
approximation algorithms
greedy algorithm
np hard
objective function
lower bound
approximation ratio
multi class
integrality gap
special case
worst case
upper bound
linear programming
primal dual
linear programming relaxation
kernel classifiers