1 citations · 1 across the 8 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs
Sander Borst, Moritz Venzin
We study the rent-or-buy variant of the online Steiner forest problem on node- and edge-weighted graphs. For -node graphs with at most non-zero node-weights, and at mo…
cs.DS2025
Learning-Augmented Online Covering Problems
Afrouz Jabal Ameli, Laura Sanita, Moritz Venzin
We give a very general and simple framework to incorporate predictions on requests for online covering problems in a rigorous and black-box manner. Our framework turns any online a…