Advances in Steiner trees

zbMATH Open0932.00010MaRDI QIDQ1966103FDOQ1966103

Authors:

Publication date: 24 February 2000

Published in: Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

Steiner trees

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06)

Cited In (14)

• Steiner's problem in double trees
• (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
• The Euclidean bottleneck full Steiner tree problem
• The full Steiner tree problem
• The Clustered Selected-Internal Steiner Tree Problem
• On the edge capacitated Steiner tree problem
• A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
• Bottleneck Steiner tree with bounded number of Steiner vertices
• Approaches to the Steiner Problem in Networks
• Combinatorial optimization in system configuration design
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Multi-Level Steiner Trees.
• Approximating the selected-internal Steiner tree
• A tutorial on the balanced minimum evolution problem

This page was built for publication: Advances in Steiner trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1966103)