The simulated greedy algorithm for several submodular matroid secretary problems
From MaRDI portal
Publication:290918
Recommendations
Cites work
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- scientific article; zbMATH DE number 7051296 (Why is no real title available?)
- scientific article; zbMATH DE number 3383344 (Why is no real title available?)
- A Knapsack Secretary Problem with Applications
- A multiple-choice secretary algorithm with applications to online auctions
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- Competitive weighted matching in transversal matroids
- Improved competitive ratio for the matroid secretary problem
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Matroid secretary problem in the random-assignment model
- Matroids, secretary problems, and online mechanisms
- Secretary problems: laminar matroid and interval scheduling
- Submodular secretary problem and extensions
- The Secretary Problem and Its Extensions: A Review
- Who solved the secretary problem
Cited in
(7)- Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints
- Prior independent mechanisms via prophet inequalities with limited information
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Strong algorithms for the ordinal matroid secretary problem
- Submodular secretary problems: cardinality, matching, and linear constraints
- The simulated greedy algorithm for several submodular matroid secretary problems
- The submodular secretary problem goes linear
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)
