algorithms-optimization / Online algorithms
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.
Temporal state
No reconciled state yet.
Append-only history
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.
Research memory
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.
Evidence graph
No public relationships recorded yet.