scientific article; zbMATH DE number 1305435

zbMath0946.68107MaRDI QIDQ4252319

Stefan Hougardy, Hans Jürgen Prömel

Publication date: 17 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Steiner tree approximation algorithms

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (20)

An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 ⋮ The Clustered Selected-Internal Steiner Tree Problem ⋮ On the approximability of the Steiner tree problem. ⋮ Approximating the Generalized Capacitated Tree-Routing Problem ⋮ Combination algorithms for Steiner tree variants ⋮ Strong Steiner Tree Approximations in Practice ⋮ Bounding the payment of approximate truthful mechanisms ⋮ An Efficient Approximation Algorithm for the Steiner Tree Problem ⋮ Definition and algorithms for reliable Steiner tree problem ⋮ An improved algorithm for the Steiner tree problem with bounded edge-length ⋮ Bottleneck Steiner tree with bounded number of Steiner vertices ⋮ A partition-based relaxation for Steiner trees ⋮ The Euclidean bottleneck full Steiner tree problem ⋮ Concurrent multicast in weighted networks ⋮ Approximating the selected-internal Steiner tree ⋮ Travelling on graphs with small highway dimension ⋮ Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs ⋮ Steiner trees in uniformly quasi-bipartite graphs. ⋮ On the terminal Steiner tree problem. ⋮ Steiner Problems with Limited Number of Branching Nodes

This page was built for publication: