Pages that link to "Item:Q2658048"
From MaRDI portal
The following pages link to New results for the \(k\)-secretary problem (Q2658048):
Displayed 4 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)
- Knapsack secretary through boosting (Q6176551) (← links)