Keyword

Steiner tree problem

Description: A combinatorial optimization problem seeking a minimum-cost network connecting specified terminals, potentially using additional intermediate vertices.

Primary topic: Complexity and Algorithms in Graphs (34%)

Wikidata ID: wiki/Q1764144

OpenAlex ID: keywords/steiner-tree-problem

Routing of multipoint connections

1988 · B.M. Waxman · IEEE Journal on Selected Areas in Communications · 2,895

Proof verification and the hardness of approximation problems

1998 · Sanjeev Arora, Carsten Lund, et al. · Journal of the ACM · 1,415

PDF

A fast algorithm for Steiner trees

1981 · L. Kou, G. Markowsky, et al. · Acta Informatica · 1,193

The shortest path through many points

1959 · Jillian Beardwood, J. H. Halton, et al. · Mathematical Proceedings of the Cambridge Philosophical Society · 946

A General Approximation Technique for Constrained Forest Problems

1995 · Michel X. Goemans, David P. Williamson · SIAM Journal on Computing · 884

An approximate solution for the Steiner problem in graphs

1980 · Haruhisa Takahashi, A Matsuyama · Mathematica japonica · 881

The Steiner Tree Problem

1992 · Frank K. Hwang, Dana Richards, et al. · 879

The steiner problem in graphs

1971 · S. E. Dreyfus, R. A. Wagner · Networks · 697

Convergence of an annealing algorithm

1986 · M. Lundy, A. Mees · Mathematical Programming · 695

Steiner tree problems

1992 · F. K. Hwang, Dana S. Richards · Networks · 669

On Steiner trees and minimum spanning trees in hypergraphs

2002 · Tobias Polzin, Siavash Vahdati Daneshmand · Operations Research Letters · 623

On Steiner’s Problem with Rectilinear Distance

1966 · M. Hanan · SIAM Journal on Applied Mathematics · 623

Steiner problem in networks: A survey

1987 · Pawel Winter · Networks · 599

Buffer placement in distributed RC-tree networks for minimal Elmore delay

2002 · L.P.P.P. van Ginneken · IEEE International Symposium on Circuits and Systems proceedings · 563

Steiner problem in networks: a survey

1987 · WinterP. · Networks · 563

Improved Steiner tree approximation in graphs

2000 · Gabriel Robins, Alex Zelikovsky · 529

Modern Heuristic Search Methods

1996 · V. J. Rayward‐Smith, Ibrahim H. Osman, et al. · 460

Polynomial time approximation schemes for Euclidean TSP and other geometric problems

2002 · S. Arora · 449

A faster approximation algorithm for the Steiner problem in graphs

1988 · Kurt Mehlhorn · Information Processing Letters · 421

Some NP-complete geometric problems

1976 · M. R. Garey, R. L. Graham, et al. · ACM Symposium on Theory of Computing (STOC) · 409

Dynamic Steiner Tree Problem

1991 · Makoto Imase, Bernard M. Waxman · SIAM Journal on Discrete Mathematics · 356

Steiner's problem in graphs and its implications

1971 · S. L. Hakimi · Networks · 347

Minimum-Energy Multicast in Mobile Ad Hoc Networks Using Network Coding

2005 · Y. Wu, P.A. Chou, et al. · IEEE Transactions on Communications · 340

An 11/6-approximation algorithm for the network steiner problem

1993 · A. Z. Zelikovsky · Algorithmica · 338

Tighter Bounds for Graph Steiner Tree Approximation

2005 · Gabriel Robins, Alexander Zelikovsky · SIAM Journal on Discrete Mathematics · 327

Works count: 3,970

Citation count: 64,440