On the choice of random directions for stochastic approximation algorithms.
James heilerJarod AlperPublished in: IEEE Trans. Autom. Control. (2006)
Keyphrases
- approximation algorithms
- approximation schemes
- np hard
- special case
- vertex cover
- minimum cost
- worst case
- facility location problem
- approximation ratio
- network design problem
- constant factor
- exact algorithms
- np hardness
- open shop
- set cover
- precedence constraints
- primal dual
- approximation guarantees
- combinatorial auctions
- randomized algorithms
- randomly generated
- optimization problems
- computational complexity