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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
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
-
Online Min-Cost Matching with General Arrivals
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.
-
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.