Retrospective Approximation Algorithms for the Multidimensional Stochastic Root-Finding Problem.
Raghu PasupathyBruce W. SchmeiserPublished in: WSC (2004)
Keyphrases
- approximation algorithms
- np hard
- special case
- approximation schemes
- vertex cover
- worst case
- exact algorithms
- minimum cost
- randomized algorithms
- facility location problem
- open shop
- set cover
- np hardness
- network design problem
- approximation ratio
- primal dual
- constant factor approximation
- polynomial time approximation
- approximation guarantees
- tabu search
- lower bound
- computational complexity