Understanding the correlation gap for matchings
From MaRDI portal
Recommendations
- Competitive weighted matching in transversal matroids
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- Robust randomized matchings
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (extended abstract)
- Stochastic Matching with Few Queries: New Algorithms and Tools
Cites work
- Finding a maximum matching in a sparse random graph in O ( n ) expected time
- How to sell hyperedges: the hypermatching assignment problem
- scientific article; zbMATH DE number 2127722 (Why is no real title available?)
- scientific article; zbMATH DE number 1139976 (Why is no real title available?)
- scientific article; zbMATH DE number 3277547 (Why is no real title available?)
- Karp-Sipser on random graphs with a fixed degree sequence
- On the existence of a factor of degree one of a connected random graph
- Perfect matchings in random bipartite graphs with minimal degree at least 2
- Price of correlations in stochastic optimization
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
Cited in
(7)- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- A simple optimal contention resolution scheme for uniform matroids
- Optimal online contention resolution schemes via ex-ante prophet inequalities
- On the correlation gap of matroids
- Towards an optimal contention resolution scheme for matchings
- Towards an optimal contention resolution scheme for matchings
- Random order vertex arrival contention resolution schemes for matching, with applications
This page was built for publication: Understanding the correlation gap for matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136324)
