Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections.
Jannik MatuschkeAndreas BleyBenjamin MüllerPublished in: ESA (2013)
Keyphrases
- approximation algorithms
- facility location
- facility location problem
- multi commodity
- np hard
- integer programming
- steiner tree
- special case
- minimum cost
- network design problem
- worst case
- mixed integer
- network design
- lagrangian relaxation
- vertex cover
- primal dual
- approximation ratio
- spanning tree
- multi criteria
- constant factor
- linear programming
- combinatorial auctions
- upper bound
- undirected graph
- lot sizing
- graphical models
- branch and bound algorithm