Pages that link to "Item:Q5173256"

The following pages link to Matroid Secretary for Regular and Decomposable Matroids (Q5173256):

Displaying 15 items.

• Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
• The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
• Matroid prophet inequalities and applications to multi-dimensional mechanism design (Q1735736) (← links)
• Secretary markets with local information (Q2010597) (← links)
• Prior independent mechanisms via prophet inequalities with limited information (Q2278945) (← links)
• Secretary Markets with Local Information (Q3449504) (← links)
• Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
• The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
• Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
• On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) (Q5009328) (← links)
• Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← 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)
• (Q5741716) (redirect page) (← links)