ScholarLens Back to search
2014•Unpublished venueRequires access

Approximating Full Steiner Tree in a Unit Disk Graph.

Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid

Open publisher page 1 citations

Abstract

Given an edge-weighted graph G = (V,E) and a sub-set R of V, a Steiner tree of G is a tree which spans all the vertices in 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 we present a 20-approximation algorithm for the full Steiner tree problem when G is a unit disk graph. 1

About this research paper

What this paper is about

Given an edge-weighted graph G = (V,E) and a sub-set R of V, a Steiner tree of G is a tree which spans all the vertices in 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 we present a 20-approximation algorithm for the full Steiner tree problem when G is a unit disk graph. 1

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Given an edge-weighted graph G = (V,E) and a sub-set R of V, a Steiner tree of G is a tree which spans all the vertices in 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 we present a 20-approximation algorithm for the full Steiner tree problem when G is a unit disk graph. 1

Key concepts: Steiner tree problem, Combinatorics, Gomory–Hu tree, k-minimum spanning tree, K-ary tree, Mathematics, Graph, Tree (set theory)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Approximating Full Steiner Tree in a Unit Disk Graph. — Research Paper | ScholarLens