On Steiner Minimal Trees with Rectilinear Distance

We consider Steiner minimal trees in the plane with rectilinear distance. The rectilinear distance d(p1, p2) between two points p1, p2is |x1- x2| + |y1- y2...

FK Hwang - 《Siam Journal on Applied Mathematics》

The Steiner problem with edge lengths 1 and 2

The Steiner problem on networks asks for a shortest subgraph spanning a given subset of distinguished vertices. We give a 4 3-approximation algorithm for t...

M Bern，P Plassmann - 《Information Processing Letters》

An 11/6-approximation algorithm for the network steiner problem

An instance of the Network Steiner Problem consists of an undirected graph with edge lengths and a subset of vertices; the goal is to find a minimum cost S...

AZ Zelikovsky - 《Algorithmica》

On optimal interconnections for VLSI

On Optimal Interconnections for VLSI describes, from a geometric perspective, algorithms for high-performance, high-density interconnections during the global and detailed routing phases of circuit layout. First, the book addresses area ...

AB Kahng，G Robins - Springer US

A faster approximation algorithm for the Steiner tree problem in graphs

We develop a new approximation algorithm which has a time complexity $O(n\\log n+m)$, where $n=\\vert V\\vert$ is the number of vertices in a connected and...

Q Lu - 《Information Processing Letters》

An exact rectilinear Steiner tree algorithm

Given a set of terminals in the plane, a rectilinear Steiner minimal tree is a shortest interconnection among these terminals using only horizontal and ver...

JS Salowe，DM Warme - IEEE International Conference on Computer Design: Vlsi in Computers & Processors

1991: The Steiner tree problem

Presents a mathematical problem on designing a minimum cost spanning tree submitted in the 1991 Mathematical Contest in Modeling. Specification of rectangu...

B Fusaro - 《Umap Journal》

Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem

The classical Steiner tree problem requires a shortest tree spanning a given vertex subset within a graph G=(V,E). An important variant is the Steiner tree...

U Fößmeier，MK Zelikovsky - 《Discrete & Computational Geometry》

A faster approximation algorithm for the Steiner problem in graphs

We present a new implementation of the Kou, Markowsky and Berman algorithm for finding a Steiner tree for a connected, undirected distance graph with a spe...

Kurt，Mehlhorn - 《Information Processing Letters》

Improved Approximations for the Steiner Tree Problem

For a set S contained in a metric space, a Steiner tree of S is a tree that connects the points in S. Finding a minimum cost Steiner tree is an NP-hard pro...

PB Ramaiyer - 《Journal of Algorithms》