Online bipartite matching with random arrivals

DOI10.1145/1993636.1993716zbMath1288.68288MaRDI QIDQ5419130

Mohammad Mahdian, Qiqi Yan

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1993636.1993716

zbMATH Keywords

online matching; random arrival; factor-revealing LP

Mathematics Subject Classification ID

90C27: Combinatorial optimization

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W27: Online algorithms; streaming algorithms