The simulated greedy algorithm for several submodular matroid secretary problems

DOI10.1007/s00224-015-9642-4zbMath1339.68343MaRDI QIDQ290918

F. Blanchet-Sadri, M. Dambrine

Publication date: 3 June 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2013/3958/

zbMATH Keywords

submodular function; matroid; secretary problem

Mathematics Subject Classification ID

68W40: Analysis of algorithms

90C27: Combinatorial optimization

05B35: Combinatorial aspects of matroids and geometric lattices

68W27: Online algorithms; streaming algorithms