Packing returning secretaries
From MaRDI portal
Recommendations
Cites work
- A Knapsack Secretary Problem with Applications
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- A survey of the coupon collector's problem with random sample sizes
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
- Beyond matroids: secretary problem and prophet inequality with general constraints
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Combinatorial secretary problems with ordinal information
- Matroid Secretary Problems
- Matroids, secretary problems, and online mechanisms
- On maximizing welfare when utility functions are subadditive
- Online independent set beyond the worst-case: secretaries, prophets, and periods
- Primal beats dual on online packing LPs in the random-order model
- Secretary markets with local information
- Strong algorithms for the ordinal matroid secretary problem
- Submodular secretary problems: cardinality, matching, and linear constraints
- The coupon-collector problem revisited — a survey of engineering problems and computational methods
- The returning secretary
- The submodular secretary problem goes linear
- The Temp Secretary Problem
- Who solved the secretary problem
This page was built for publication: Packing returning secretaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091060)
