A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique.
Krzysztof NowickiPublished in: CoRR (2019)
Keyphrases
- preprocessing
- minimum spanning tree
- detection algorithm
- np hard
- learning algorithm
- optimization algorithm
- times faster
- cost function
- dynamic programming
- experimental evaluation
- computational cost
- search space
- clustering method
- computational complexity
- improved algorithm
- matching algorithm
- ant colony optimization
- linear programming
- computationally efficient
- high accuracy
- worst case
- segmentation algorithm
- theoretical analysis
- particle swarm optimization
- neural network
- search algorithm
- relaxation algorithm