Pages that link to "Item:Q4637502"

The following pages link to The Submodular Secretary Problem Goes Linear (Q4637502):

Displaying 12 items.

• Secretary markets with local information (Q2010597) (← links)
• Online algorithms for the maximum \(k\)-interval coverage problem (Q2091105) (← links)
• Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints (Q2140573) (← links)
• Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints (Q5002619) (← links)
• A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
• (Q5090369) (← links)
• (Q5091060) (← links)
• Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
• Prophet Secretary (Q5348218) (← links)
• Online Contention Resolution Schemes with Applications to Bayesian Selection Problems (Q5856151) (← links)
• Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
• Packing returning secretaries (Q6087124) (← links)