On greedy approximation algorithms for a class of two-stage stochastic assignment problems.
Serdar KarademirNan KongOleg A. ProkopyevPublished in: Optim. Methods Softw. (2014)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- network design problem
- set cover
- minimum cost
- integer programming
- constant factor
- randomized algorithms
- np hardness
- greedy algorithm
- linear program
- exact algorithms
- open shop
- facility location problem
- primal dual
- approximation ratio
- constant factor approximation
- approximation schemes
- search algorithm
- undirected graph
- resource allocation
- multi class
- upper bound
- dynamic programming