scientific article; zbMATH DE number 750011
From MaRDI portal
Publication:4764186
zbMath0826.68067MaRDI QIDQ4764186
Gabriel Robins, Andrew B. Kahng
Publication date: 1 May 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (20)
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem ⋮ Steiner Trees with Bounded RC-Delay ⋮ A better constant-factor approximation for selected-internal Steiner minimum tree ⋮ Computing optimal Steiner trees in polynomial space ⋮ Extending the kernel for planar Steiner tree to the number of Steiner vertices ⋮ An improved approximation scheme for the Group Steiner Problem ⋮ An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 ⋮ (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree ⋮ Delay-related secondary objectives for rectilinear Steiner minimum trees. ⋮ Faster Steiner Tree Computation in Polynomial-Space ⋮ An Efficient Approximation Algorithm for the Steiner Tree Problem ⋮ Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm ⋮ Steiner trees with bounded RC-delay ⋮ Steiner hull algorithm for the uniform orientation metrics ⋮ Bottleneck Steiner tree with bounded number of Steiner vertices ⋮ The Euclidean bottleneck full Steiner tree problem ⋮ A near linear time approximation scheme for Steiner tree among obstacles in the plane ⋮ Approximating the selected-internal Steiner tree ⋮ Parameterized Complexity of Directed Steiner Tree on Sparse Graphs ⋮ On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic
This page was built for publication:
