1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2023
Delaying Decisions and Reservation Costs
Elisabet Burjons, Fabian Frei, Matthias Gehnen +3
We study the Feedback Vertex Set and the Vertex Cover problem in a natural variant of the classical online model that allows for delayed decisions and reservations. Both problems c…
cs.DS2023★ 1 cited
Advice Complexity bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems
Niklas Berndt, Henri Lotze
Let F be a fixed finite obstruction set of graphs and G be a graph revealed in an online fashion, node by node. The online Delayed F-Node-Deletion Problem (F-Edge-Deletion Problem}…