Document Open Access Logo

Online and Incremental Fractional Vertex Cover on Trees

Authors Júlia Baligács , Bartłomiej Bosek , Yann Disser , Andreas Emil Feldmann , Grzegorz Gutowski , Katarzyna Kępińska, Paweł Putra , Anna Zych-Pawlewicz

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2026.158.pdf
  • Filesize: 0.82 MB
  • 15 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Discrete mathematics
  • Theory of computation → Online algorithms
Keywords
  • fractional vertex cover
  • online algorithms
  • incremental algorithms
  • edge arrival model
  • trees
  • competitive analysis

Metrics

Abstract

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 11/6 ≈ 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.

Cite As Get BibTex

Júlia Baligács, Bartłomiej Bosek, Yann Disser, Andreas Emil Feldmann, Grzegorz Gutowski, Katarzyna Kępińska, Paweł Putra, and Anna Zych-Pawlewicz. Online and Incremental Fractional Vertex Cover on Trees. In 34th Annual European Symposium on Algorithms (ESA 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 388, pp. 158:1-158:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ESA.2026.158

Author Details

Júlia Baligács
  • Department of Computer Science, University of Oxford, UK
Bartłomiej Bosek
  • Institute of Theoretical Computer Science, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland
Yann Disser
  • Department of Mathematics, TU Darmstadt, Germany
Andreas Emil Feldmann
  • Department of Computer Science, University of Sheffield, UK
Grzegorz Gutowski
  • Institute of Theoretical Computer Science, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland
Katarzyna Kępińska
  • Institute of Theoretical Computer Science, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland
Paweł Putra
  • Institute of Informatics, University of Warsaw, Poland
Anna Zych-Pawlewicz
  • Institute of Informatics, University of Warsaw, Poland

Funding

This work is a result of research conducted within research project number 2023/51/B/ST6/02833 financed by the National Science Centre, Poland (Bartłomiej Bosek, Grzegorz Gutowski, Katarzyna Kępińska, Paweł Putra and Anna Zych-Pawlewicz)
  • Baligács, Júlia: During employment in Warsaw supported by ERC grant BOBR (grant no. 948057). During employment in Oxford supported by ERC grant CCOO (grant no. 101165139).

References

  1. Aaron Bernstein, Yann Disser, Martin Groß, and Sandra Himburg. General bounds for incremental maximization. Mathematical Programming, 191(2):953-979, 2022. URL: https://doi.org/10.1007/s10107-020-01576-0.
  2. Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, and Madhu Sudan. The minimum latency problem. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC), pages 163-171, 1994. URL: https://doi.org/10.1145/195058.195125.
  3. Niv Buchbinder, Kamal Jain, and Joseph (Seffi) Naor. Online primal-dual algorithms for maximizing ad-auctions revenue. In Proceedings of the 15th Annual European Symposium on Algorithms (ESA), pages 253-264, 2007. URL: https://doi.org/10.1007/978-3-540-75520-3_24.
  4. Niv Buchbinder, Danny Segev, and Yevgeny Tkach. Online algorithms for maximum cardinality matching with edge arrivals. Algorithmica, 81(5):1781-1799, 2019. URL: https://doi.org/10.1007/s00453-018-0505-7.
  5. Marek Chrobak, Claire Kenyon, John Noga, and Neal E. Young. Incremental medians via online bidding. Algorithmica, 50(4):455-478, 2008. URL: https://doi.org/10.1007/s00453-007-9005-x.
  6. Ilan Reuven Cohen and David Wajc. Randomized online matching in regular graphs. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 960-979, 2018. URL: https://doi.org/10.1137/1.9781611975031.62.
  7. Nikhil R. Devanur, Kamal Jain, and Robert D. Kleinberg. Randomized primal-dual analysis of ranking for online bipartite matching. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 101-107, 2013. URL: https://doi.org/10.1137/1.9781611973105.7.
  8. Yann Disser, Max Klimm, Annette Lutz, and David Weckbecker. Fractionally subadditive maximization under an incremental knapsack constraint with applications to incremental flows. SIAM Journal on Discrete Mathematics, 38(1):764-789, 2024. URL: https://doi.org/10.1137/23M1569265.
  9. Yann Disser, Max Klimm, Nicole Megow, and Sebastian Stiller. Packing a knapsack of unknown capacity. SIAM Journal on Discrete Mathematics, 31(3):1477-1497, 2017. URL: https://doi.org/10.1137/16M1070049.
  10. Yann Disser, Max Klimm, Kevin Schewior, and David Weckbecker. Incremental maximization via continuization. In Proceedings of the 50th International Colloquium on Automata, Languages, and Programming (ICALP), pages 47:1-47:17, 2023. URL: https://doi.org/10.4230/LIPIcs.ICALP.2023.47.
  11. Yann Disser and David Weckbecker. Incremental maximization for a broad class of objectives. In Proceedings of the 33rd Annual European Symposium on Algorithms (ESA), pages 92:1-92:13, 2025. URL: https://doi.org/10.4230/LIPIcs.ESA.2025.92.
  12. Ryo Fujita, Yusuke Kobayashi, and Kazuhisa Makino. Robust matchings and matroid intersections. SIAM Journal on Discrete Mathematics, 27(3):1234-1256, 2013. URL: https://doi.org/10.1137/100808800.
  13. Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, and David Wajc. Online matching with general arrivals. In Proceedings of the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 26-37, 2019. URL: https://doi.org/10.1109/FOCS.2019.00011.
  14. Michel X. Goemans and Jon M. Kleinberg. An improved approximation ratio for the minimum latency problem. Mathematical Programming, 82:111-124, 1998. URL: https://doi.org/10.1007/BF01585867.
  15. Teofilo F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985. URL: https://doi.org/10.1016/0304-3975(85)90224-5.
  16. Refael Hassin and Shlomi Rubinstein. Robust matchings. SIAM Journal on Discrete Mathematics, 15(4):530-537, 2002. URL: https://doi.org/10.1137/S0895480198332156.
  17. Tianle Jiang and Yuhao Zhang. Edge arrival online matching: The power of free disposal on acyclic graphs. In Web and Internet Economics, pages 591-608, 2026. URL: https://doi.org/10.1007/978-3-032-08560-3_33.
  18. Naonori Kakimura and Kazuhisa Makino. Robust independence systems. SIAM Journal on Discrete Mathematics, 27(3):1257-1273, 2013. URL: https://doi.org/10.1137/120899480.
  19. Richard M. Karp, Umesh V. Vazirani, and Vijay V. Vazirani. An optimal algorithm for on-line bipartite matching. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 352-358, 1990. URL: https://doi.org/10.1145/100216.100262.
  20. Euiwoong Lee and Sahil Singla. Maximum matching in the online batch-arrival model. ACM Transactions on Algorithms, 16(4):49:1-49:31, 2020. URL: https://doi.org/10.1145/3399676.
  21. Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, and David P. Williamson. A general approach for incremental approximation and hierarchical clustering. SIAM Journal on Computing, 39(8):3633-3669, 2010. URL: https://doi.org/10.1137/070698257.
  22. Mohammad Mahdian and Qiqi Yan. Online bipartite matching with random arrivals: An approach based on strongly factor-revealing lps. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC), pages 597-606, 2011. URL: https://doi.org/10.1145/1993636.1993716.
  23. Jannik Matuschke, Martin Skutella, and José A. Soto. Robust randomized matchings. Mathematics of Operations Research, 43(2):675-692, 2018. URL: https://doi.org/10.1287/moor.2017.0878.
  24. Nicole Megow and Julián Mestre. Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. In Proceedings of the 4th Innovations in Theoretical Computer Science Conference (ITCS), pages 495-504, 2013. URL: https://doi.org/10.1145/2422436.2422490.
  25. Ramgopal R. Mettu and C. Greg Plaxton. The online median problem. SIAM Journal on Computing, 32(3):816-832, 2003. URL: https://doi.org/10.1137/S0097539701383443.
  26. Joseph (Seffi) Naor and David Wajc. Near-optimum online ad allocation for targeted advertising. ACM Transactions on Economics and Computation, 6(3-4):16:1-16:20, 2018. URL: https://doi.org/10.1145/3105447.
  27. C. Greg Plaxton. Approximation algorithms for hierarchical location problems. Journal of Computer and System Sciences, 72(3):425-443, 2006. URL: https://doi.org/10.1016/j.jcss.2005.09.004.
  28. Zhihao Gavin Tang. Optimal competitive ratio of two-sided online bipartite matching, 2026. URL: https://doi.org/10.48550/arXiv.2602.18049.
  29. Zhihao Gavin Tang and Yuhao Zhang. Improved bounds for fractional online matching problems. In Proceedings of the 25th ACM Conference on Economics and Computation, pages 279-307, 2024. URL: https://doi.org/10.1145/3670865.3673459.
  30. Yajun Wang and Sam Chiu-wai Wong. Two-sided online bipartite matching and vertex cover: Beating the greedy algorithm. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP), pages 1070-1081, 2015. URL: https://doi.org/10.1007/978-3-662-47672-7_87.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact