Beating Greedy for Stochastic Bipartite Matching

DOI10.1137/1.9781611975482.176zbMath1432.68569arXiv1909.12760OpenAlexW2903354203MaRDI QIDQ5236367

Ola Svensson, Sagar Kale, Buddhima Gamlath

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.12760

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Economics of information (91B44) Approximation algorithms (68W25) Matching models (91B68)

Related Items (1)

Prophet Matching with General Arrivals

This page was built for publication: Beating Greedy for Stochastic Bipartite Matching