NeurIPS 2019
Sun Dec 8th through Sat the 14th, 2019 at Vancouver Convention Center
Paper ID:1393
Title:Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time

This is a nice contribution on deterministic (non-monotone) submodular maximization subject to a size constraint. All the reviewers liked the paper. Please add the missing references to the final version.