Approximation Algorithms for Bounded Facility Location Problems.

Piotr Krysta Roberto Solis-Oba

Published in: J. Comb. Optim. (2001)

Keyphrases

approximation algorithms
facility location problem
np hard
special case
worst case
vertex cover
minimum cost
set cover
primal dual
approximation ratio
open shop
network design problem
randomized algorithms
greedy algorithm
approximation guarantees
polynomial time approximation
upper bound
disjoint paths