Login / Signup
Approximation algorithms for hard capacitated k-facility location problems.
Karen Aardal
Pieter L. van den Berg
Dion Gijswijt
Shanfei Li
Published in:
Eur. J. Oper. Res. (2015)
Keyphrases
</>
facility location problem
approximation algorithms
np hard
special case
worst case
vertex cover
network design problem
approximation ratio
minimum cost
set cover
randomized algorithms
constant factor
primal dual
combinatorial auctions
upper bound
disjoint paths
constant factor approximation