跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.12210 · v1

Tight Competitive Bounds for Online Matching on Forests

首次提交 2026-11-09 19:05
版本更新 2026-11-09 19:05
雷达观测 2026-11-10 15:22
arXiv ↗PDF ↗

摘要

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/74/7 against an oblivious adversary, improving the previous 5/95/9 guarantee. We also present a deterministic algorithm that simultaneously maintains a 4/74/7-competitive fractional matching and a 7/47/4-competitive fractional vertex cover. This deterministic algorithm improves the previous 5/95/9 guarantee for fractional matching and the 11/611/6 guarantee for fractional vertex cover. We prove that 4/74/7 is optimal for both randomized and fractional matching, even on growing trees of maximum degree four.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-09 19:05 · 最新观测版本

Tight Competitive Bounds for Online Matching on Forests

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/74/7 against an oblivious adversary, improving the previous 5/95/9 guarantee. We also present a deterministic algorithm that simultaneously maintains a 4/74/7-competitive fractional matching and a 7/47/4-competitive fractional vertex cover. This deterministic algorithm improves the previous 5/95/9 guarantee for fractional matching and the 11/611/6 guarantee for fractional vertex cover. We prove that 4/74/7 is optimal for both randomized and fractional matching, even on growing trees of maximum degree four.

查看此版本解读 →查看此版本原文 ↗