scientific article; zbMATH DE number 742979
From MaRDI portal
Publication:4763418
zbMath0829.68063MaRDI QIDQ4763418
Piotr Berman, Viswanathan Ramaiyer
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (8)
A primal-dual approximation algorithm for the Steiner forest problem ⋮ Bottleneck bichromatic full Steiner trees ⋮ A primal-dual approximation algorithm for generalized Steiner network problems ⋮ An improved approximation scheme for the Group Steiner Problem ⋮ On the low-dimensional Steiner minimum tree problem in Hamming metric ⋮ A simple proof of the planar rectilinear Steiner ratio ⋮ Approximating the tree and tour covers of a graph ⋮ A faster approximation algorithm for the Steiner tree problem in graphs
This page was built for publication:
