Secretary problems: laminar matroid and interval scheduling
From MaRDI portal
Recommendations
Cited in
(27)- Online interval scheduling with a bounded number of failures
- Secretary markets with local information
- Worst case compromises in matroids with applications to the allocation of indivisible goods
- Generalized laminar matroids
- A note on the online interval scheduling secretary problem
- Approximation algorithms for stochastic combinatorial optimization problems
- The simulated greedy algorithm for several submodular matroid secretary problems
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Secretary markets with local information
- Secretary Problems via Linear Programming
- Secretary problems: weights and discounts
- The submodular secretary problem goes linear
- Strong algorithms for the ordinal matroid secretary problem
- A Framework for the Secretary Problem on the Intersection of Matroids
- Hiring secretaries over time: the benefit of concurrent employment
- Secretary Problems via Linear Programming
- Laminar matroids
- 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
- Improved competitive ratio for the matroid secretary problem
- Constant-competitiveness for random assignment matroid secretary without knowing the matroid
- Matroid-constrained vertex cover
- An FPTAS for budgeted laminar matroid independent set
- Matroid secretary via labeling schemes
- Constant-competitiveness for random assignment matroid secretary without knowing the matroid
- Laminar matroid secretary: greedy strikes back
- Beating competitive ratio 4 for graphic matroid secretary
This page was built for publication: Secretary problems: laminar matroid and interval scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365115)
