Tighter Bounds for Online Bipartite Matching

DOI10.1007/978-3-662-59204-5_7zbMath1453.68218arXiv1812.11774OpenAlexW2907311556MaRDI QIDQ3295268

No author found.

Publication date: 8 July 2020

Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)

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

zbMATH Keywords

integer sequencesfractional matchingonline matchingranking algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Matching theory
• An optimal deterministic algorithm for online \(b\)-matching
• Bayesian Mechanism Design
• AdWords and generalized online matching
• Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching

This page was built for publication: Tighter Bounds for Online Bipartite Matching