Pages that link to "Item:Q2428661"

The following pages link to Competitive weighted matching in transversal matroids (Q2428661):

Displaying 12 items.

• The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
• Secretary markets with local information (Q2010597) (← links)
• Prior independent mechanisms via prophet inequalities with limited information (Q2278945) (← links)
• Size versus truthfulness in the house allocation problem (Q2319628) (← links)
• Online Collaborative Filtering on Graphs (Q2830757) (← links)
• Secretary Markets with Local Information (Q3449504) (← links)
• The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
• Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
• A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
• The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids (Q5208744) (← links)
• A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558) (← links)
• Secretary and online matching problems with machine learned advice (Q6108930) (← links)