Online Steiner Forest with Recourse
Yaowei Long, Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski

TL;DR
This paper introduces an online Steiner forest algorithm that maintains a low-cost solution with minimal edge modifications per demand, improving adaptability over traditional methods.
Contribution
It presents the first low-recourse algorithm for online Steiner forest with constant competitiveness and logarithmic amortized recourse.
Findings
Achieves constant competitive ratio in online Steiner forest.
Maintains an amortized recourse of O(log n) edges per demand.
Demonstrates effectiveness of low-recourse strategies in online network design.
Abstract
In the online Steiner forest problem we are given a graph , and a sequence of terminal pairs which arrive in an online fashion. We are asked to maintain a low-cost subgraph in which each is connected to for all the pairs that have arrived so far. If we are not allowed to delete edges from our solution, then the best possible competitive ratio is . In this work, we initiate the study of low-recourse algorithms for online Steiner forest. We give an algorithm that maintains a constant-competitive solution and has an amortized recourse of , i.e., inserts and deletes edges per demand on average.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
