Conference
Aug 2026
Online and Incremental Fractional Vertex Cover on Trees
This paper presents an $\frac{11}{6} \approx 1.83$-competitive algorithm for trees in the more general edge arrival model and gives a 1.5-competitive algorithm and provide a matching lower bound.
Júlia Baligács, B. Bosek, Y. Disser et al.
· Embedded Systems and Applica... · 1 citation