Pages that link to "Item:Q3088096"
From MaRDI portal
The following pages link to Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096):
Displaying 14 items.
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
- Online crowdsourced truck delivery using historical information (Q2140193) (← links)
- Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints (Q2140573) (← links)
- The Temp Secretary Problem (Q3452826) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
- Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints (Q5002619) (← links)
- A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
- A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558) (← links)
- Prophet Secretary (Q5348218) (← links)
- Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online <i>K</i>-Item Auction and Bipartite <i>K</i>-Matching with Random Arrival Order (Q5363004) (← links)
- Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)