Login / Signup
Fully-dynamic minimum spanning forest with improved worst-case update time.
Christian Wulff-Nilsen
Published in:
STOC (2017)
Keyphrases
</>
worst case
dynamic environments
dynamically updated
np hard
dynamically changing
greedy algorithm
multi class
lower bound
xml documents
computer vision
upper bound
multi agent systems
reinforcement learning
multiscale
error bounds
database systems
case study
update rules
decision making