Login / Signup
Tight approximation algorithms for maximum general assignment problems.
Lisa Fleischer
Michel X. Goemans
Vahab S. Mirrokni
Maxim Sviridenko
Published in:
SODA (2006)
Keyphrases
</>
approximation algorithms
special case
worst case
np hard
open shop
vertex cover
lower bound
randomized algorithms
facility location problem
minimum cost
set cover
network design problem
constant factor
upper bound
approximation ratio
primal dual
np hardness
approximation schemes
computational complexity