arXiv · 2611.12210
Tight Competitive Bounds for Online Matching on Forests
Abstract
We study the online matching problem, its fractional relaxation, and the fractional online vertex cover problem on forests whose edges arrive one at a time in an arbitrary order. Matching decisions are irrevocable, and vertex-cover weights can only increase over time. For online matching, we present a randomized algorithm with expected competitive ratio $4/7$ against an oblivious adversary, improving the previous $5/9$ guarantee. We also present a deterministic algorithm that simultaneously maintains a $4/7$-competitive fractional matching and a $7/4$-competitive fractional vertex cover. This deterministic algorithm improves the previous $5/9$ guarantee for fractional matching and the $11/6$ guarantee for fractional vertex cover. We prove that $4/7$ is optimal for both randomized and fractional matching, even on growing trees of maximum degree four.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Bartłomiej Bosek, Grzegorz Gutowski, Paweł Putra, Anna Zych-Pawlewicz. 2026-11-09. Tight Competitive Bounds for Online Matching on Forests. https://searcharxiv.com/abs/2611.12210
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.