An Almost Singularly Optimal Asynchronous Distributed MST Algorithm.
Fabien DufoulonShay KuttenWilliam K. Moses Jr.Gopal PanduranganDavid PelegPublished in: DISC (2022)
Keyphrases
- dynamic programming
- optimal solution
- learning algorithm
- worst case
- detection algorithm
- experimental evaluation
- significant improvement
- np hard
- times faster
- minimum spanning tree
- optimization algorithm
- computational complexity
- globally optimal
- high accuracy
- computationally efficient
- improved algorithm
- theoretical analysis
- closed form
- hardware implementation
- distributed systems
- cost function
- k means
- space complexity
- optimal path
- locally optimal
- linear programming
- tree structure
- segmentation algorithm
- expectation maximization
- simulated annealing
- preprocessing
- data structure
- objective function
- similarity measure