A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities.
Michael ElkinPublished in: J. ACM (2020)
Keyphrases
- k means
- detection algorithm
- high accuracy
- np hard
- optimization algorithm
- expectation maximization
- worst case
- experimental evaluation
- probabilistic model
- improved algorithm
- times faster
- dynamic programming
- objective function
- multi objective
- learning algorithm
- significant improvement
- computational complexity
- segmentation algorithm
- optimal solution
- clustering method
- matching algorithm
- cost function
- search space
- simulated annealing
- particle swarm optimization
- multi agent
- path planning
- decision trees