Tight Bound for Online Vertex Cover under Edge Arrivals
What is the optimal competitive ratio for online vertex cover when edges arrive one at a time? The paper proves a tight factor-2 lower bound via a reduction in the blueprint framework of Assadi, Jiang and Xiang, closing the gap left by prior work.
Exact FrontierDelta
Scope and record
Occurred: Aug 5, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. Imported under CC BY 4.0.
Canonical aliases: Tight Bound for Online Vertex Cover under Edge Arrivals · Online vertex cover
Confidence: Not scored
Registry verification: unreviewed · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
Zhihao Gavin Tang
human · human collaborator
GPT-5.6 Sol
model · ai model contributor · OpenAI
Lineage and corrections
This event attributed to Zhihao Gavin Tang
This event attributed to GPT-5.6 Sol