de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons134206

Kesselheim,  Thomas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Tönnis,  Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: http://hdl.handle.net/11858/00-001M-0000-002C-4E60-9
Abstract
There is no abstract available