A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Power of Dynamic Distance Oracles
2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15
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 weights, and our goal is to maintain a tree which is a good approximation of the minimum Steiner tree spanning a terminal set S ⊆ V , which changes over time. The changes applied to the terminal set are either terminal additions (incremental scenario), terminal removals (decremental scenario), or both (fully dynamic
doi:10.1145/2746539.2746615
dblp:conf/stoc/LackiOPSZ15
fatcat:bo7oiwea7ne43ooq5ho4ycw5by