Online total bipartite matching problem

DOI10.1007/S11590-021-01814-0zbMath1492.90155OpenAlexW4206747672MaRDI QIDQ2136880

Meghan Shanks, Jacobson, Sheldon H.

Publication date: 16 May 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01814-0

zbMATH Keywords

online algorithmsrandomized algorithmsbipartite matching

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Online matching with blocked input
• Bayesian Mechanism Design
• Online Stochastic Matching: Online Actions Based on Offline Statistics
• Online Stochastic Weighted Matching: Improved Approximation Algorithms
• AdWords and generalized online matching
• Designing Aviation Security Passenger Screening Systems Using Nonlinear Control
• Improved Bounds for Online Stochastic Matching
• Online Stochastic Matching: Beating 1-1/e
• How to match when all vertices arrive online
• Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
• Online Stochastic Matching: New Algorithms with Better Bounds

This page was built for publication: Online total bipartite matching problem