Aug 15, 2013 · 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 ...

In this paper, we propose a fully dynamic algorithm for the Steiner tree problem in a planar graph. We consider an undirected weighted planar graph.

The Steiner problem in graphs is a fundamental and well-studied optimiza- tion problem: given a graph with edge lengths and a set of terminals, find a.

Aug 16, 2013 · 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 ...

In this paper, we propose a fully dynamic algorithm for the Steiner tree problem in a planar graph. We consider a planar edge-weighted undirected graph.

Abstract. 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 ...

We give a polynomial-time approximation scheme (PTAS) for the Steiner tree problem in planar graphs. The running time is O(n log n).

Jun 14, 2015 · We have shown the first sublinear time algorithm which maintains a constant approximate Steiner tree under terminal additions and deletions.

In this paper, we propose a fully dynamic algorithm for the Steiner tree problem in a planar graph. We consider an undirected weighted planar graph.

It is shown that the proposed fully dynamic algorithm maintains a $(2+\epsilon)$ approximate Steiner tree in $\tilde{O}(\vert S\vert ^{2}\sqrt{n}+\vert S ...