Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time

Alan Kuhnle. Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time. In Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d'Alché-Buc, Edward A. Fox, Roman Garnett, editors, Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8-14 December 2019, Vancouver, BC, Canada. pages 2371-2381, 2019. [doi]

@inproceedings{Kuhnle19-0,
  title = {Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time},
  author = {Alan Kuhnle},
  year = {2019},
  url = {http://papers.nips.cc/paper/8508-interlaced-greedy-algorithm-for-maximization-of-submodular-functions-in-nearly-linear-time},
  researchr = {https://researchr.org/publication/Kuhnle19-0},
  cites = {0},
  citedby = {0},
  pages = {2371-2381},
  booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8-14 December 2019, Vancouver, BC, Canada},
  editor = {Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d'Alché-Buc and Edward A. Fox and Roman Garnett},
}