2000•Journal of AlgorithmsRequires access

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3

Hans Jürgen Prömel, Angelika Steger

Open publisher page 110 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 110 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.

Key concepts: Steiner tree problem, Approximation algorithm, k-minimum spanning tree, Mathematics, Polynomial-time approximation scheme, Spanning tree, Minimum spanning tree, Tree (set theory)

Back to paper search Browse research topics Original source

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 — Research Paper | ScholarLens