Approximation Algorithms for Min-Max Generalization Problems.
Piotr BermanSofya RaskhodnikovaPublished in: APPROX-RANDOM (2010)
Keyphrases
- approximation algorithms
- min max
- vertex cover
- np hard
- special case
- approximation schemes
- randomized algorithms
- minimum cost
- worst case
- network design problem
- np hardness
- primal dual
- exact algorithms
- max min
- facility location problem
- open shop
- np complete
- set cover
- optimization problems
- convex optimization
- branch and bound