Greedy Bipartite Matching in Random Type Poisson Arrival Model

DOI10.4230/LIPIcs.APPROX-RANDOM.2018.5OpenAlexW2964076874MaRDI QIDQ5009497

Denis Pankratov, Christodoulos Karavasilis, Allan Borodin

Publication date: 4 August 2021

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

zbMATH Keywords

online algorithmsbipartite matchinggreedy algorithmsstochastic input models

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

An Experimental Study of Algorithms for Online Bipartite Matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy matching: guarantees and limitations
• Differential equations for random processes and random graphs
• Bayesian Mechanism Design
• Online Stochastic Matching: Online Actions Based on Offline Statistics
• Online Stochastic Weighted Matching: Improved Approximation Algorithms
• Online Stochastic Matching: Beating 1-1/e
• Online Stochastic Matching: New Algorithms with Better Bounds
• Solutions of ordinary differential equations as limits of pure jump markov processes
• On the Convergence of Binomial to Poisson Distributions

This page was built for publication: Greedy Bipartite Matching in Random Type Poisson Arrival Model