Advances in Steiner trees
From MaRDI portal
Publication:1966103
zbMath0932.00010MaRDI QIDQ1966103
No author found.
Publication date: 24 February 2000
Published in: Combinatorial Optimization (Search for Journal in Brave)
Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Related Items (13)
A tutorial on the balanced minimum evolution problem ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ The Clustered Selected-Internal Steiner Tree Problem ⋮ (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree ⋮ On the edge capacitated Steiner tree problem ⋮ Bottleneck Steiner tree with bounded number of Steiner vertices ⋮ The Euclidean bottleneck full Steiner tree problem ⋮ The full Steiner tree problem ⋮ Approximating the selected-internal Steiner tree ⋮ Approaches to the Steiner Problem in Networks ⋮ Combinatorial optimization in system configuration design ⋮ Steiner's problem in double trees
This page was built for publication: Advances in Steiner trees
