Online min-cost matching with general arrivals has unbounded competitive ratio in adversarial and random-order models but admits an O(log² n)-competitive algorithm in the unknown i.i.d. model.
Fully Online Matching.J
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
A new ordered local search algorithm achieves k/2 + o(k) approximation for monotone submodular maximization over k matroids and (ln 4 k)/3 + o(k) for weighted k-set packing.
Authors are developing an Isabelle/HOL library to formalize primal-dual analyses for classical and modern matching algorithms including the Hungarian method and Adwords.
citing papers explorer
-
Formal Primal-Dual Algorithm Analysis
Authors are developing an Isabelle/HOL library to formalize primal-dual analyses for classical and modern matching algorithms including the Hungarian method and Adwords.