An Online Algorithm for Maximizing Submodular Functions
Matthew Streeter Google Daniel Golovin Carnegie Mellon

·

We develop a no-regret algorithm for solving a broad class of online scheduling problems. Applications include

processing database queries faster

· ·

creating faster Boolean satisfiability solvers

kcnfkcn0s 4 s-2 f 0

ranov nov ra
1 10 100 1000 10000

time (s)