Metraipolis › archive › dc_202ba277e73d
Online and Incremental Fractional Vertex Cover on Trees — arXiv:2608.24630
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.24630
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T07:03:49.589Z
- SHA-256 of the archived text
acaf792dd22a157a3f8685ad1bfb4e909789f9a81099d690e99f692cbb392dda- Stable URL of this page
https://metraipolis.com/documento/dc_202ba277e73d
How to cite
Online and Incremental Fractional Vertex Cover on Trees — arXiv:2608.24630 — arXiv (en), https://arxiv.org/abs/2608.24630 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_202ba277e73d (Metraipolis archive dc_202ba277e73d, sha256 acaf792dd22a157a3f8685ad1bfb4e909789f9a81099d690e99f692cbb392dda)
BibTeX
@misc{dc202ba277e73d,
title = {Online and Incremental Fractional Vertex Cover on Trees — arXiv:2608.24630},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.24630},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_202ba277e73d; sha256 acaf792dd22a157a3f8685ad1bfb4e909789f9a81099d690e99f692cbb392dda},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24630. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper we study the fractional vertex cover problem on trees in two related models: online and incremental. In the online model, the vertices of the tree are known a priori and the edges arrive one at a time. The goal is to maintain a fractional vertex cover of the tree, i.e., an assignment of fractional weights from [0,1] to the vertices such that the weights of endpoints of every edge sum up to at least one. After each edge arrival, we need to modify the fractional vertex cover to cover the new edge as well. However, we can only increase the values assigned to vertices. The problem was studied before (in the vertex arrival model) by Wang and Wong, who motivated it as a generalization of the ski-rental problem, but also (more importantly) by its close connection to the dual online matching problem. They presented a 1.901-competitive algorithm for general graphs in the vertex arrival model. We present an $\frac{11}{6} \approx 1.83$-competitive algorithm for trees in the more general edge arrival model. In addition, we study the fractional vertex cover problem in an incremental model, where we again seek a fractional vertex cover after every update, but all the updates to the tree are known to the algorithm a priori. In this model, we give a 1.5-competitive algorithm and provide a matching lower bound.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-26 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.24630 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T07:01:33.499Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).