scientific article; zbMATH DE number 742979
From MaRDI portal
Publication:4763418
zbMATH Open0829.68063MaRDI QIDQ4763418FDOQ4763418
Authors: Piotr Berman, Viswanathan Ramaiyer 
Publication date: 11 April 1995
Title of this publication is not available (Why is that?)
Recommendations
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cited In (37)
- On the low-dimensional Steiner minimum tree problem in Hamming metric
- On better heuristics for Steiner minimum trees
- 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
- A primal-dual approximation algorithm for generalized Steiner network problems
- Tighter Bounds for Graph Steiner Tree Approximation
- The General Steiner Tree-Star problem.
- Approximating Steiner trees and forests with minimum number of Steiner points
- Improved computation of plane Steiner minimal trees
- An Efficient Approximation Algorithm for the Steiner Tree Problem
- Title not available (Why is that?)
- On the low-dimensional Steiner minimum tree problem in Hamming metric
- Title not available (Why is that?)
- An improved approximation scheme for the Group Steiner Problem
- Recent results on approximating the Steiner tree problem and its generalizations
- On the approximability of the Steiner tree problem.
- Bottleneck bichromatic full Steiner trees
- A faster approximation algorithm for the Steiner tree problem in graphs
- Title not available (Why is that?)
- Steiner points in tree metrics don't (really) help
- Title not available (Why is that?)
- Approximating Alternative Solutions
- Title not available (Why is that?)
- Improved upper bounds for the Steiner ratio
- Approximating the tree and tour covers of a graph
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
- Improved Steiner tree algorithms for bounded treewidth
- Convexity and the Steiner tree problem
- Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
- Improved approximation algorithms for the quality of service Steiner tree problem.
- On efficient implementation of an approximation algorithm for the Steiner tree problem
- On approximability of Steiner tree in \(\ell_p\)-metrics
- Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights
- A primal-dual approximation algorithm for the Steiner forest problem
- A simple proof of the planar rectilinear Steiner ratio
- Improved Approximations for the Steiner Tree Problem
- Approximating minimum Steiner point trees in Minkowski planes
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763418)
