The simulated greedy algorithm for several submodular matroid secretary problems
DOI10.1007/S00224-015-9642-4zbMATH Open1339.68343OpenAlexW1529760171MaRDI QIDQ290918FDOQ290918
Authors: Tengyu Ma, Bo Tang, Yajun Wang 
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/
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Knapsack Secretary Problem with Applications
- Matroid secretary problem in the random-assignment model
- A multiple-choice secretary algorithm with applications to online auctions
- Matroids, secretary problems, and online mechanisms
- Improved competitive ratios for submodular secretary problems (extended abstract)
- The Secretary Problem and Its Extensions: A Review
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Secretary problems: laminar matroid and interval scheduling
- Improved competitive ratio for the matroid secretary problem
- Who solved the secretary problem
- Competitive weighted matching in transversal matroids
- Submodular secretary problem and extensions
- Title not available (Why is that?)
- Algorithms for Secretary Problems on Graphs and Hypergraphs
Cited In (7)
- Strong algorithms for the ordinal matroid secretary problem
- The submodular secretary problem goes linear
- Submodular secretary problems: cardinality, matching, and linear constraints
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints
- Prior independent mechanisms via prophet inequalities with limited information
- The simulated greedy algorithm for several submodular matroid secretary problems
This page was built for publication: The simulated greedy algorithm for several submodular matroid secretary problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290918)
