Approximation algorithms for MAX-MIN tiling.
Piotr BermanBhaskar DasGuptaS. MuthukrishnanPublished in: J. Algorithms (2003)
Keyphrases
- max min
- approximation algorithms
- np hard
- min max
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- hill climbing
- primal dual
- open shop
- set cover
- randomized algorithms
- approximation ratio
- precedence constraints
- approximation schemes
- robust optimization
- constant factor
- objective function
- decision making
- polynomial time approximation
- linear programming
- simulated annealing