An Almost Singularly Optimal Asynchronous Distributed MST Algorithm.
Fabien DufoulonShay KuttenWilliam K. Moses Jr.Gopal PanduranganDavid PelegPublished in: CoRR (2022)
Keyphrases
- dynamic programming
- worst case
- computational complexity
- improved algorithm
- cost function
- np hard
- computational cost
- preprocessing
- segmentation algorithm
- simulated annealing
- optimal solution
- operating point
- globally optimal
- closed form
- clustering method
- experimental evaluation
- learning algorithm
- optimal path
- optimal strategy
- hardware implementation
- recognition algorithm
- search space
- k means
- theoretical analysis
- high accuracy
- detection algorithm
- optimization algorithm
- tree structure
- multi objective
- search algorithm
- input data
- exhaustive search
- data structure
- linear programming
- distributed systems
- minimum spanning tree