@InProceedings{kesselheim_et_al:LIPIcs.APPROX-RANDOM.2017.16,
  author =	{Kesselheim, Thomas and T\"{o}nnis, Andreas},
  title =	{{Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)},
  pages =	{16:1--16:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-044-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{81},
  editor =	{Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.16},
  URN =		{urn:nbn:de:0030-drops-75657},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2017.16},
  annote =	{Keywords: Secretary Problem, Online Algorithms, Submodular Maximization}
}