Averaging and derivative estimation within stochastic approximation algorithms.
Fatemeh Sadat HashemiRaghu PasupathyPublished in: WSC (2012)
Keyphrases
- approximation algorithms
- approximation schemes
- np hard
- special case
- vertex cover
- minimum cost
- facility location problem
- worst case
- network design problem
- primal dual
- set cover
- open shop
- exact algorithms
- precedence constraints
- np hardness
- constant factor
- lower bound
- search algorithm
- genetic algorithm
- undirected graph
- error bounds
- approximation ratio
- search space