On full Steiner trees in unit disk graphs (Q2349739)

Given an edge-weighted graph \(G=(V,E)\) and a subset \(R\) of \(V\), a Steiner tree of \(G\) is a tree which spans all the vertices of \(R\). A full Steiner tree is a Steiner tree which has all the vertices of \(R\) as its leaves. The full Steiner tree problem is to find a full Steiner tree of \(G\) with minimum weight. In this paper, the authors consider the full Steiner tree problem when \(G\) is a unit disk graph and give a 20-approximation algorithmn for the Steiner tree problem in \(G\).