An Online Algorithm for Maximizing Submodular Functions.

Matthew J. Streeter Daniel Golovin

Published in: NIPS (2008)

Keyphrases

dynamic programming
cost function
worst case
similarity measure
computational complexity
particle swarm optimization
neural network
image segmentation
objective function
np hard
scheduling problem
markov random field
convex hull
submodular functions