A Parallel MCMC Algorithm for the Balanced Graph Coloring Problem.
Donatello ConteGiuliano GrossiRaffaella LanzarottiJianyi LinAlessandro PetriniPublished in: GbRPR (2019)
Keyphrases
- preprocessing
- detection algorithm
- optimization algorithm
- parallel implementation
- learning algorithm
- probabilistic model
- monte carlo
- k means
- experimental evaluation
- search space
- markov chain
- np hard
- dynamic programming
- high accuracy
- similarity measure
- kalman filter
- simulated annealing
- cost function
- worst case
- particle swarm optimization
- parameter estimation
- significant improvement
- computational complexity
- clustering method
- energy function
- search algorithm
- optimal solution
- times faster
- convergence rate
- objective function