The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree

Jakub Łącki, Jakub Oćwieja, Marcin Pilipczuk +2

In this paper we study the Steiner tree problem over a dynamic set of terminals. We consider the model where we are given an $n$-vertex graph $G=(V,E,w)$ with positive real edge we…