Online minimum matching with uniform metric and random arrivals
- 1 January 2022
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 50 (1) , 45-49
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (IIS-1948157)
This publication has 3 references indexed in Scilit:
- Greedy metric minimum online matchings with random arrivalsOperations Research Letters, 2019
- A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite MatchingAlgorithmica, 2012
- Online Weighted MatchingJournal of Algorithms, 1993