Approximation Algorithms for Bounded Facility Location.
Piotr KrystaRoberto Solis-ObaPublished in: COCOON (1999)
Keyphrases
- approximation algorithms
- facility location
- facility location problem
- np hard
- integer programming
- special case
- network design
- lagrangian relaxation
- worst case
- minimum cost
- vertex cover
- network design problem
- approximation ratio
- primal dual
- multi criteria
- constant factor
- undirected graph
- randomized algorithms
- lower bound
- mixed integer
- knapsack problem
- valid inequalities
- linear programming
- upper bound
- dynamic programming