Pages that link to "Item:Q4554073"
From MaRDI portal
The following pages link to Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073):
Displaying 9 items.
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Online generalized assignment problem with historical information (Q2108140) (← links)
- Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints (Q2140573) (← links)
- How the experts algorithm can help solve LPs online (Q2833109) (← links)
- A Dynamic Near-Optimal Algorithm for Online Linear Programming (Q2931707) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Packing returning secretaries (Q6087124) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
- A truthful near-optimal mechanism for online linear packing-covering problem in the random order model (Q6543267) (← links)