Almost sure convergence of two time-scale stochastic approximation algorithms.
Vladislav B. TadicPublished in: ACC (2004)
Keyphrases
- approximation algorithms
- approximation schemes
- np hard
- special case
- stochastic approximation
- vertex cover
- exact algorithms
- facility location problem
- minimum cost
- approximation ratio
- open shop
- worst case
- precedence constraints
- np hardness
- randomized algorithms
- primal dual
- network design problem
- disjoint paths
- polynomial time approximation
- undirected graph
- combinatorial auctions
- lower bound
- optimal solution