Pages that link to "Item:Q2658048"
From MaRDI portal
The following pages link to New results for the \(k\)-secretary problem (Q2658048):
Displaying 7 items.
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Improved online algorithm for fractional knapsack in the random order model (Q2085749) (← links)
- Online algorithms for the maximum \(k\)-interval coverage problem (Q2091105) (← links)
- A new look at the returning secretary problem (Q2424722) (← links)
- Improved algorithms and analysis for secretary problems and generalizations (Q2706186) (← links)
- Uniformly Bounded Regret in the Multisecretary Problem (Q5113899) (← links)
- (Q5875579) (← links)