Sign in

Semi-Online Bipartite Matching

By Ravi Kumar and others
In this paper we introduce the \emph{semi-online} model that generalizes the classical online computational model. The semi-online model postulates that the unknown future has a predictable part and an adversarial part; these parts can be arbitrarily interleaved. An algorithm in this model operates as in the standard online model, i.e.,... Show more
September 4, 2019
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...