No article text was recorded for this version.
stochastic matching approximation
Version 1 of 148 papers73 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Towards a better understanding of randomized greedy matching
- Blog: Beating (1 - 1/e)-Approximation for Weighted Stochastic Matching
- Blog: Stochastic Matching with Few Queries: New Algorithms and Tools
- Blog: Weighted Matchings via Unweighted Augmentations
- Blog: Beating Ratio 0.5 for Weighted Oblivious Matching Problems
- Blog: Weighted Matching in the Random-Order Streaming and Robust Communication Models
- Blog: Generalized Stochastic Matching
- Blog: Query Efficient Weighted Stochastic Matching
- Blog: The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm
- Blog: Beating Greedy for Stochastic Bipartite Matching
- Blog: Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the Rescue
- Blog: Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
- Blog: The Greedy Algorithm Is not Optimal for On-Line Edge Coloring
- Blog: On Sparsification of Stochastic Packing Problems
- Blog: When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings.
- Blog: Semi-streaming algorithms for submodular matroid intersection
- Blog: Online Stochastic Matching: New Algorithms with Better Bounds
- Blog: The Computational Complexity of Weighted Greedy Matching
- Blog: Online Selection Problems against Constrained Adversary
- Blog: Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark
- Blog: When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
- Blog: Improved Algorithm for Dynamic b-Matching
- Blog: Size Versus Truthfulness in the House Allocation Problem
- Blog: Proportionally Fair Matching via Randomized Rounding
- Blog: Online Matching Meets Sampling Without Replacement
- Blog: Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching
- Blog: Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
- Blog: Blind, Greedy, and Random: Algorithms for Matching and Clustering Using Only Ordinal Information
- Blog: A New Impossibility Result for Online Bipartite Matching Problems
- Blog: Integrated Optimization of Bipartite Matching and Its Stochastic Behavior: New Formulation and Approximation Algorithm via Min-cost Flow Optimization
- Blog: Online Bipartite Matching with Decomposable Weights
- Blog: A (2+ε)-Approximation for Maximum Weight Matching in the Semi-Streaming Model
- Blog: Streaming Algorithms for Graph K-Matching with Optimal or Near-Optimal Update Time
- Blog: Towards a better understanding of randomized greedy matching
- Blog: Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities
- Blog: Almost Optimal Stochastic Weighted Matching With Few Queries
- Blog: When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
- Blog: A Matching-Based Algorithm for the Traveling Tournament Problem
- Blog: Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations
- Blog: A framework for boosting matching approximation: parallel, distributed, and dynamic
- Blog: Improved Bounds in Stochastic Matching and Optimization
- Blog: Beating (1-1/e)-Approximation for Weighted Stochastic Matching
- Blog: Multiplicative auction algorithm for approximate maximum weight bipartite matching
- Blog: Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation
- Blog: Online Metric Matching: Beyond the Worst Case
- Blog: Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation
- Blog: Better bounds for matchings in the streaming model
- Blog: Stochastic Vertex Cover with Few Queries
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_stochastic_matching_approximation_059af8d3,
title = {stochastic matching approximation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/stochastic-matching-approximation/rdr_059af8d36b3644f69a7da877380492aa},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_stochastic_matching_approximation_059af8d3_v1,
title = {stochastic matching approximation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/stochastic-matching-approximation/rdr_059af8d36b3644f69a7da877380492aa/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}