%0 Conference Paper %1 conf/approx/KesselheimT17 %A Kesselheim, Thomas %A Tönnis, Andreas %B APPROX-RANDOM %D 2017 %E Jansen, Klaus %E Rolim, José D. P. %E Williamson, David %E Vempala, Santosh S. %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 16:1-16:22 %T Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints. %U http://dblp.uni-trier.de/db/conf/approx/approx2017.html#KesselheimT17 %V 81 %@ 978-3-95977-044-6

@inproceedings{conf/approx/KesselheimT17, added-at = {2018-08-23T00:00:00.000+0200}, author = {Kesselheim, Thomas and Tönnis, Andreas}, biburl = {https://www.bibsonomy.org/bibtex/260415df493b73c712cd20a04739f5e01/dblp}, booktitle = {APPROX-RANDOM}, crossref = {conf/approx/2017}, editor = {Jansen, Klaus and Rolim, José D. P. and Williamson, David and Vempala, Santosh S.}, ee = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.16}, interhash = {b014cf04e0da84574854a33ecfe74205}, intrahash = {60415df493b73c712cd20a04739f5e01}, isbn = {978-3-95977-044-6}, keywords = {dblp}, pages = {16:1-16:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-10T00:34:15.000+0200}, title = {Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints.}, url = {http://dblp.uni-trier.de/db/conf/approx/approx2017.html#KesselheimT17}, volume = 81, year = 2017 }