A note on the random greedy independent set algorithm.

Patrick Bennett Tom Bohman

Published in: Random Struct. Algorithms (2016)

Keyphrases

dynamic programming
locally optimal
search space
learning algorithm
computational complexity
independent set
search algorithm
k means
np hard
average case
probabilistic model
hill climbing
randomly generated
graph structure
simulated annealing
worst case
objective function
feature selection