Login / Signup
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities.
Michael Elkin
Published in:
PODC (2017)
Keyphrases
</>
learning algorithm
detection algorithm
optimal solution
dynamic programming
k means
high accuracy
significant improvement
experimental evaluation
improved algorithm
cost function
np hard
minimum spanning tree
linear programming
classification algorithm
computational cost
matching algorithm
preprocessing
objective function
theoretical analysis
optimization algorithm
path planning
recognition algorithm
clustering method
probabilistic model
input data
simulated annealing
worst case
search space
search algorithm
data structure
multi agent
similarity measure