@book{fisher1978,
  title={An analysis of approximations for maximizing submodular set functions—II},
  author={Fisher, Marshall L and Nemhauser, George L and Wolsey, Laurence A},
  year={1978},
  publisher={Springer}
}

@article{nemhauser1978,
  title={An analysis of approximations for maximizing submodular set functions--I},
  author={Nemhauser, George L and Wolsey, Laurence A and Fisher, Marshall L},
  journal={Mathematical Programming},
  volume={14},
  number={1},
  pages={265--294},
  year={1978},
  publisher={Springer}
}

@article{edmonds1971,
  title={Matroids and the greedy algorithm},
  author={Edmonds, Jack},
  journal={Mathematical programming},
  volume={1},
  number={1},
  pages={127--136},
  year={1971},
  publisher={Springer}
}

@article{feige1998,
  title={A threshold of ln n for approximating set cover},
  author={Feige, Uriel},
  journal={Journal of the ACM (JACM)},
  volume={45},
  number={4},
  pages={634--652},
  year={1998},
  publisher={ACM}
}

@article{khuller1999,
  title={The budgeted maximum coverage problem},
  author={Khuller, Samir and Moss, Anna and Naor, Joseph Seffi},
  journal={Information Processing Letters},
  volume={70},
  number={1},
  pages={39--45},
  year={1999},
  publisher={Elsevier}
}

@article{sviridenko2004,
  title={A note on maximizing a submodular set function subject to a knapsack constraint},
  author={Sviridenko, Maxim},
  journal={Operations Research Letters},
  volume={32},
  number={1},
  pages={41--43},
  year={2004},
  publisher={Elsevier}
}

@incollection{calinescu2007,
  title={Maximizing a submodular set function subject to a matroid constraint},
  author={Calinescu, Gruia and Chekuri, Chandra and P{\'a}l, Martin and Vondr{\'a}k, Jan},
  booktitle={Integer programming and combinatorial optimization},
  pages={182--196},
  year={2007},
  publisher={Springer}
}

@inproceedings{vondrak2011,
  title={Submodular function maximization via the multilinear relaxation and contention resolution schemes},
  author={Vondr{\'a}k, Jan and Chekuri, Chandra and Zenklusen, Rico},
  booktitle={Proceedings of the forty-third annual ACM symposium on Theory of computing},
  pages={783--792},
  year={2011},
  organization={ACM}
}

@inproceedings{lin2010,
  title={Multi-document summarization via budgeted maximization of submodular functions},
  author={Lin, Hui and Bilmes, Jeff},
  booktitle={Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics},
  pages={912--920},
  year={2010},
  organization={Association for Computational Linguistics}
}

@book{schrijver2003,
  title={Combinatorial optimization: polyhedra and efficiency},
  author={Schrijver, Alexander},
  volume={24},
  year={2003},
  publisher={Springer}
}

@article{calinescu2011,
  title={Maximizing a monotone submodular function subject to a matroid constraint},
  author={Calinescu, Gruia and Chekuri, Chandra and P{\'a}l, Martin and Vondr{\'a}k, Jan},
  journal={SIAM Journal on Computing},
  volume={40},
  number={6},
  pages={1740--1766},
  year={2011},
  publisher={SIAM}
}

@article{ageev2004,
  author    = {Alexander A. Ageev and
               Maxim Sviridenko},
  title     = {Pipage Rounding: {A} New Method of Constructing Algorithms with Proven
               Performance Guarantee},
  journal   = {J. Comb. Optim.},
  volume    = {8},
  number    = {3},
  pages     = {307--328},
  year      = {2004},
  timestamp = {Sun, 15 Nov 4434325 05:30:56 +},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jco/AgeevS04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{vondrak2008,
  title={Optimal approximation for the submodular welfare problem in the value oracle model},
  author={Vondr{\'a}k, Jan},
  booktitle={Proceedings of the fortieth annual ACM symposium on Theory of computing},
  pages={67--74},
  year={2008},
  organization={ACM}
}

@inproceedings{filmus2012,
    author = {Yuval Filmus and Justin Ward},
    title = {Maximum coverage over a matroid},
    booktitle = {29th Symposium on Theoretical Aspects of Computer Science ({STACS})},
    year = {2012}
}

@inproceedings{filmus2012tight,
    author = {Yuval Filmus and Justin Ward},
    title = {A tight combinatorial algorithm for submodular maximization subject to a matroid constraint},
    booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science ({FOCS})},
    year = {2012}
}

@article{filmus2014,
    author = {Yuval Filmus and Justin Ward},
    title = {Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search},
    journal = {SIAM Journal on Computing},
    volume = {43},
    issue = {2},
    year = {2014},
    pages = {514--542}
}

@article{feige2011,
  author    = {Uriel Feige and
               Vahab S. Mirrokni and
               Jan Vondr{\'{a}}k},
  title     = {Maximizing Non-monotone Submodular Functions},
  journal   = {{SIAM} Journal on Computing},
  volume    = {40},
  number    = {4},
  pages     = {1133--1153},
  year      = {2011},
  timestamp = {Wed, 10 Aug 2011 12:19:12 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/FeigeMV11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{buchbinder2012,
  author    = {Niv Buchbinder and
               Moran Feldman and
               Joseph Naor and
               Roy Schwartz},
  title     = {A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular
               Maximization},
  booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, ({FOCS})},
  pages     = {649--658},
  year      = {2012},
  timestamp = {Tue, 16 Dec 2014 09:57:20 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/BuchbinderFNS12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{lee2009,
  author    = {Jon Lee and
               Vahab S. Mirrokni and
               Viswanath Nagarajan and
               Maxim Sviridenko},
  title     = {Non-monotone submodular maximization under matroid and knapsack constraints},
  booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
               {STOC} 2009},
  pages     = {323--332},
  year      = {2009},
  timestamp = {Fri, 05 Jun 2009 09:34:35 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/LeeMNS09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@unpublished{filmus2011,
  title={Hardness of Approximating Set Cover},
  author={Filmus, Yuval},
  year={2011},
  month={January}
}