Pages that link to "Item:Q4571927"
From MaRDI portal
The following pages link to Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927):
Displaying 9 items.
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint (Q5870351) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- Edge-weighted online bipartite matching (Q6551261) (← links)
- Two-sided capacitated submodular maximization in gig platforms (Q6609176) (← links)
- Pricing heterogeneous products to heterogeneous customers who buy sequentially (Q6638856) (← links)