Pages that link to "Item:Q290918"
From MaRDI portal
The following pages link to The simulated greedy algorithm for several submodular matroid secretary problems (Q290918):
Displaying 7 items.
- Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints (Q2140573) (← links)
- Prior independent mechanisms via prophet inequalities with limited information (Q2278945) (← links)
- The simulated greedy algorithm for several submodular matroid secretary problems (Q2957909) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
- Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
- Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints (Q5002619) (← links)
- A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558) (← links)