Faster and simpler approximation algorithms for mixed packing and covering problems.

Florian Diedrich Klaus Jansen

Published in: Theor. Comput. Sci. (2007)

Keyphrases

approximation algorithms
vertex cover
np hard
randomized algorithms
special case
np complete
exact algorithms
np hardness
network design problem
facility location problem
approximation schemes
primal dual
objective function
lower bound
optimization problems