Kesselheim, Thomas Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Tönnis, Andreas Algorithms and Complexity, MPI for Informatics, Max Planck Society;
http://drops.dagstuhl.de/opus/volltexte/2016/6396/ (Publisher version)
http://drops.dagstuhl.de/doku/urheberrecht1.html (Copyright transfer agreement)
Kesselheim, T., & Tönnis, A. (2016). Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. In P. Sankowski, & C. Zaroliagis (Eds.), 24th Annual European Symposium on Algorithms (pp. 1-17). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ESA.2016.54.