A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-Width.
Narek BojikianStefan KratschPublished in: ICALP (2024)
Keyphrases
- monte carlo
- worst case
- computational cost
- importance sampling
- monte carlo simulation
- monte carlo methods
- optimal solution
- adaptive sampling
- computational complexity
- markov chain
- convergence rate
- learning algorithm
- dynamic programming
- np hard
- cost function
- objective function
- combinatorial optimization
- minimum spanning tree
- variance reduction
- stochastic approximation
- lower bound