Login / Signup
Approximation algorithms for facility location problems with a special class of subadditive cost functions.
Adriana Felicia Gabor
Jan-Kees C. W. van Ommeren
Published in:
Theor. Comput. Sci. (2006)
Keyphrases
</>
approximation algorithms
facility location problem
cost function
np hard
special case
worst case
vertex cover
network design problem
mixed integer
set cover
primal dual
optimization problems
objective function
randomized algorithms
approximation ratio
demand points
facility location
constant factor
disjoint paths