A deterministic algorithm for the MST problem in constant rounds of congested clique.
Krzysztof NowickiPublished in: STOC (2021)
Keyphrases
- learning algorithm
- dynamic programming
- experimental evaluation
- cost function
- preprocessing
- high accuracy
- theoretical analysis
- objective function
- recognition algorithm
- computationally efficient
- computational cost
- np hard
- search space
- particle swarm optimization
- k means
- minimum spanning tree
- simulated annealing
- linear programming
- classification algorithm
- optimal solution