Approximation Algorithms for the Max-Min Allocation Problem.
Subhash KhotAshok Kumar PonnuswamiPublished in: APPROX-RANDOM (2007)
Keyphrases
- max min
- approximation algorithms
- np hard
- min max
- special case
- vertex cover
- worst case
- minimum cost
- open shop
- network design problem
- constant factor
- set cover
- approximation ratio
- primal dual
- robust optimization
- hill climbing
- randomized algorithms
- precedence constraints
- scheduling problem
- approximation guarantees
- graphical models
- undirected graph
- model selection