Tight Approximation Algorithms for Maximum Separable Assignment Problems.
Lisa FleischerMichel X. GoemansVahab S. MirrokniMaxim SviridenkoPublished in: Math. Oper. Res. (2011)
Keyphrases
- approximation algorithms
- worst case
- np hard
- lower bound
- special case
- vertex cover
- minimum cost
- upper bound
- facility location problem
- set cover
- open shop
- network design problem
- exact algorithms
- approximation ratio
- randomized algorithms
- approximation schemes
- primal dual
- np hardness
- constant factor
- error bounds
- constant factor approximation
- genetic algorithm
- undirected graph
- combinatorial auctions
- greedy algorithm
- approximation guarantees
- polynomial time approximation
- branch and bound
- integrality gap