Strong algorithms for the ordinal matroid secretary problem
From MaRDI portal
(Redirected from Publication:5000649)
Strong algorithms for the ordinal matroid secretary problem (scientific article; zbMATH DE number 7371746)
Strong algorithms for the ordinal matroid secretary problem (scientific article; zbMATH DE number 7371746)
Recommendations
Cites work
- scientific article; zbMATH DE number 3512137 (Why is no real title available?)
- scientific article; zbMATH DE number 7051296 (Why is no real title available?)
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- scientific article; zbMATH DE number 3383344 (Why is no real title available?)
- A Knapsack Secretary Problem with Applications
- A framework for the secretary problem on the intersection of matroids
- A multiple-choice secretary algorithm with applications to online auctions
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Advances on matroid secretary problems: free order model and laminar case
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
- Beyond matroids: secretary problem and prophet inequality with general constraints
- Combinatorial prophet inequalities
- Combinatorial secretary problems with ordinal information
- Competitive weighted matching in transversal matroids
- Dynamic Programming and Decision Theory
- Frame matroids and biased graphs
- Improved algorithms and analysis for secretary problems and generalizations
- Improved competitive ratio for the matroid secretary problem
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Matroid prophet inequalities
- Matroid secretary problem in the random-assignment model
- Matroids Induced by Packing Subgraphs
- Matroids, secretary problems, and online mechanisms
- Natural realizations of sparsity matroids
- On graphs and rigidity of plane skeletal structures
- On matroids induced by packing subgraphs
- Polymatroid Prophet Inequalities
- Primal beats dual on online packing LPs in the random-order model
- Probability and Computing
- Prophet Inequalities with Limited Information
- Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- Secretary Problems via Linear Programming
- Secretary Problems with Non-Uniform Arrival Order
- Secretary problems with convex costs
- Secretary problems: laminar matroid and interval scheduling
- Strong algorithms for the ordinal matroid secretary problem
- Submodular secretary problem and extensions
- The simulated greedy algorithm for several submodular matroid secretary problems
- Transversals and matroid partition
- Who solved the secretary problem? With comments and a rejoinder by the author
Cited in
(12)- Strong algorithms for the ordinal matroid secretary problem
- From contention resolution to matroid secretary and back
- Combinatorial secretary problems with ordinal information
- Robust Algorithms for the Secretary Problem
- Online combinatorial assignment in independence systems
- Online combinatorial assignment in independence systems
- Formal barriers to simple algorithms for the matroid secretary problem
- Laminar matroid secretary: greedy strikes back
- Knapsack secretary through boosting
- Generalized assignment and knapsack problems in the random-order model
- Matroid secretary via labeling schemes
- Partial-order analogue of the secretary problem: The binary tree case
This page was built for publication: Strong algorithms for the ordinal matroid secretary problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000649)
