Monte-Carlo Approximation Algorithms for Enumeration Problems.
Richard M. KarpMichael LubyNeal MadrasPublished in: J. Algorithms (1989)
Keyphrases
- monte carlo
- approximation algorithms
- vertex cover
- monte carlo methods
- monte carlo simulation
- approximation schemes
- np hard
- special case
- np hardness
- network design problem
- markov chain
- randomized algorithms
- monte carlo tree search
- adaptive sampling
- precedence constraints
- dynamic programming
- search space
- optimal strategy
- minimum cost
- set cover
- approximation ratio
- markov random field