A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width.
Narek BojikianStefan KratschPublished in: CoRR (2023)
Keyphrases
- monte carlo
- importance sampling
- worst case
- dynamic programming
- monte carlo simulation
- steiner tree
- cost function
- computational complexity
- matrix inversion
- np hard
- markov chain
- linear programming
- stochastic approximation
- particle filter
- learning algorithm
- simulated annealing
- computational cost
- optimal solution
- particle swarm optimization
- minimum spanning tree
- search space