Matching, capturing allocation of items to unit-demand buyers, or tasks to workers, or pairs of
collaborators, is a central problem in economics. Indeed, the growing prevalence of …

Online bipartite matching is one of the most fundamental problems in the online algorithms
literature. Karp, Vazirani, and Vazirani (STOC 1990) gave an elegant algorithm for …

The classic theorem of Vizing (Diskret. Analiz.'64) asserts that any graph of maximum
degree Δ can be edge colored (offline) using no more than Δ+ 1 colors (with Δ being a trivial …

Nearly three decades ago, Bar-Noy, Motwani and Naor showed that no online edge-coloring
algorithm can edge color a graph optimally. Indeed, their work, titled" the greedy algorithm is …

We provide prophet inequality algorithms for online weighted matching in general
(nonbipartite) graphs, under two well-studied arrival models: edge arrival and vertex arrival …

Three decades ago, Karp, Vazirani, and Vazirani (STOC 1990) defined the online matching
problem and gave an optimal (1-1/e)-competitive (about 0.632) algorithm. Fifteen years later …

The Industrial Internet of Things (IIoT) integrates diverse wireless and heterogeneous
devices to enable time-sensitive applications. Multi-access edge computing (MEC) offers …

With a wide range of applications, stochastic matching problems have been studied in
different models, including prophet inequality, Query-Commit, and Price-of-Information …

We study streaming submodular maximization subject to matching/b-matching constraints
(MSM/MSbM), and present improved upper and lower bounds for these problems. On the …

We study the classic online bipartite matching problem with a twist: offline nodes are
reusable any number of times. Every offline node i becomes available d steps after it was …