Pages that link to "Item:Q3012820"
From MaRDI portal
The following pages link to Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820):
Displaying 19 items.
- Online unweighted knapsack problem with removal cost (Q486978) (← links)
- Online maximum matching with recourse (Q830934) (← links)
- Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- Buyback problem with discrete concave valuation functions (Q1751249) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Unit cost buyback problem (Q2322706) (← links)
- Maximum matching on trees in the online preemptive and the incremental graph models (Q2329370) (← links)
- Proportional cost buyback problem with weight bounds (Q2424877) (← links)
- Clairvoyant Mechanisms for Online Auctions (Q2817844) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
- On Randomized Algorithms for Matching in the Online Preemptive Model (Q3452797) (← links)
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online (Q3460333) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Online Maximum Matching with Recourse (Q5005104) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- Proportional Cost Buyback Problem with Weight Bounds (Q5743550) (← links)
- Small Space Stream Summary for Matroid Center (Q5875472) (← links)
