Near optimal algorithms for online weighted bipartite matching in adversary model

DOI10.1007/s10878-016-0100-2zbMath1376.05125MaRDI QIDQ1680479

Peng Zhang

Publication date: 16 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0100-2

zbMATH Keywords

weighted bipartite graph; online matching; adversary model; near optimal algorithm

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

91B99: Mathematical economics