A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities.
Michael ElkinPublished in: CoRR (2017)
Keyphrases
- learning algorithm
- high accuracy
- worst case
- dynamic programming
- minimum spanning tree
- times faster
- detection algorithm
- optimization algorithm
- k means
- np hard
- improved algorithm
- probabilistic model
- convergence rate
- optimal solution
- objective function
- computational complexity
- preprocessing
- segmentation algorithm
- expectation maximization
- linear programming
- distributed systems
- computational cost
- experimental evaluation
- theoretical analysis
- tree structure
- classification algorithm
- lower bound
- spanning tree