An optimal deterministic algorithm for online b-matching

This paper studies the online maximum edge-weighted b-matching problem. The input of the problem is a weighted bipartite graph G = ( L , R , E , w ) . Vertices in R arrive online, and each vertex in L can be matched to at most b vertices in R. The ...

A matching of a graph is a subset of edges no two of which share a common vertex, and a maximum matching is a matching of maximum cardinality. In a b-matching every vertex v has an associated bound $b_v$, and a maximum b-matching is a maximum set of ...${}_{}$${}_{}$$\mathrm{}$

Matching is a classic problem with a rich history and a significant impact, both on the theory of algorithms and in practice. Recently there has been a surge of interest in the online version of matching and its generalizations, due to the important new ...