Recommendations
- Secretary problem: graphs, matroids and greedoids
- Matroid secretary problem in the random assignment model
- Matroid secretary problem in the random-assignment model
- A framework for the secretary problem on the intersection of matroids
- A Framework for the Secretary Problem on the Intersection of Matroids
- Matroids, secretary problems, and online mechanisms
- The matroid secretary problem for minor-closed classes and random matroids
- Secretary Problems via Linear Programming
Cited in
(47)- Scheduling In the random-order model
- Improved online algorithms for knapsack and GAP in the random order model
- Secretary problem: graphs, matroids and greedoids
- Improved online algorithm for fractional knapsack in the random order model
- Formal barriers to simple algorithms for the matroid secretary problem
- The secretary recommendation problem
- Approximate tradeoffs on weighted labeled matroids
- Online matroid intersection: beating half for random arrival
- New results for the \(k\)-secretary problem
- Matroid secretary problem in the random-assignment model
- The simulated greedy algorithm for several submodular matroid secretary problems
- Submodular secretary problem and extensions
- Matroids, secretary problems, and online mechanisms
- The simulated greedy algorithm for several submodular matroid secretary problems
- Secretary markets with local information
- Submodular secretary problem and extensions
- House markets with matroid and knapsack constraints
- Strong algorithms for the ordinal matroid secretary problem
- A framework for the secretary problem on the intersection of matroids
- Secretary problems: weights and discounts
- Advances on matroid secretary problems: free order model and laminar case
- Strong algorithms for the ordinal matroid secretary problem
- A Framework for the Secretary Problem on the Intersection of Matroids
- Packing returning secretaries
- Combinatorial secretary problems with ordinal information
- Online independent set beyond the worst-case: secretaries, prophets, and periods
- The matroid secretary problem for minor-closed classes and random matroids
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- Beyond matroids: secretary problem and prophet inequality with general constraints
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Secretary problems: laminar matroid and interval scheduling
- Matroid secretary problem in the random assignment model
- Improved competitive ratio for the matroid secretary problem
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Constant-competitiveness for random assignment matroid secretary without knowing the matroid
- Machine covering in the random-order model
- Secretary and online matching problems with machine learned advice
- Knapsack secretary through boosting
- Scheduling in the random-order model
- Generalized assignment and knapsack problems in the random-order model
- Matroid secretary via labeling schemes
- Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid
- Constant-competitiveness for random assignment matroid secretary without knowing the matroid
- Online combinatorial assignment in independence systems
- Online combinatorial assignment in independence systems
- Laminar matroid secretary: greedy strikes back
This page was built for publication: Matroid Secretary Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625656)
