Funder
The University of Hong Kong
Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. An experimental study of algorithms for online bipartite matching;Borodin;J. Exp. Algorithmics,2020
2. Max-min greedy matching problem: hardness for the adversary and fractional variant;Chan,2023
3. Randomized online matching in regular graphs;Cohen,2018
4. Tight approximation ratio for minimum maximal matching;Dudycz,2019
5. Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs;Dutting;SIAM J. Comput.,2020