2006•Journal of Heze UniversityRequires access

An Approximation Algorithm about Full Steiner Tree Problem

Tang Heng-yong

Abstract

The full Steiner tree problem(TST) is to find a minimum weight Steiner tree with all the vertices of its leaves.Fabio Viduani Martinez and other people presented a approximation algorithm,where is the approximation ratio of the algorithm for the regular graph Steiner tree problem.For now,its minimum value is approximate 1.550.In this paper,about this full Steiner tree problem we give an approximation algorithm with an improved approximation ratio of(currently).

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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

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