Login / Signup
Best and worst case permutations for random online domination of the path.
Christopher Coscia
Jonathan DeWitt
Fan Yang
Yiguang Zhang
Published in:
Discret. Math. Theor. Comput. Sci. (2017)
Keyphrases
</>
worst case
online algorithms
online learning
real time
lower bound
shortest path
randomly distributed
average case
error bounds
greedy algorithm
data sets
decision trees
upper bound
times faster
online advertising
running times