Fast Approximation Algorithms for Fractional Packing and Covering Problems.

Serge A. Plotkin David B. Shmoys Éva Tardos

Published in: Math. Oper. Res. (1995)

Keyphrases

approximation algorithms
vertex cover
approximation schemes
special case
np hardness
np hard
network design problem
np complete
exact algorithms
randomized algorithms
worst case
minimum cost
primal dual
practical problems
quadratic program
facility location problem
evolutionary algorithm