On the almost sure rate of convergence of linear stochastic approximation algorithms.
V. B. TadicPublished in: IEEE Trans. Inf. Theory (2004)
Keyphrases
- approximation algorithms
- constant factor approximation
- np hard
- approximation schemes
- special case
- vertex cover
- minimum cost
- worst case
- facility location problem
- exact algorithms
- np hardness
- set cover
- constant factor
- primal dual
- approximation ratio
- open shop
- quadratic program
- network design problem
- approximation guarantees
- closest string
- precedence constraints
- convergence rate
- learning algorithm
- randomized algorithms
- linear programming