The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids
From MaRDI portal
Publication:5208744
DOI10.1137/16M1107899zbMath1431.05033arXiv1603.06822MaRDI QIDQ5208744
No author found.
Publication date: 10 January 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.06822
Random graphs (graph-theoretic aspects) (05C80) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of matroids compared to the number of sparse paving matroids
- Laminar matroids
- Decomposition of regular matroids
- Who solved the secretary problem
- Graph minors. XVI: Excluding a non-planar graph
- On the number of bases of almost all matroids
- On perturbations of highly connected dyadic matroids
- Branch-width and well-quasi-ordering in matroids and graphs.
- Small cocircuits in matroids
- On the asymptotic proportion of connected matroids
- The highly connected matroids in minor-closed classes
- Competitive weighted matching in transversal matroids
- Solving Rota's Conjecture
- Matroid Secretary Problem in the Random-Assignment Model
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
- Matroid Secretary Problems
- Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
- Matroid Secretary for Regular and Decomposable Matroids
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
- Dynamic Programming and Decision Theory
This page was built for publication: The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids
