2015•Journal of Discrete AlgorithmsOpen access

On the hardness of full Steiner tree problems

Ahmad Biniaz, Anil Maheshwari, Michiel Smid

Open full text 9 citations

Abstract

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

Open-access reader

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 9 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, Combinatorics, k-minimum spanning tree, Mathematics, Gomory–Hu tree, Vertex (graph theory), K-ary tree, Tree (set theory)