Online minimum matching with uniform metric and random arrivals

DOI10.1016/J.ORL.2021.12.005OpenAlexW4200161866MaRDI QIDQ2670469

Sharmila V. S. Duppala, Pan Xu, Karthik Abinav Sankararaman

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

random arrival orderuniform metric spaceonline minimum matching

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Online bottleneck matching on a line

Cites Work

• Unnamed Item
• A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
• Greedy metric minimum online matchings with random arrivals
• Randomized online algorithms for minimum metric bipartite matching
• A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
• Online Weighted Matching
• Stochastic Online Metric Matching

This page was built for publication: Online minimum matching with uniform metric and random arrivals