Results 1  10
of
454
Preferred Direction Steiner Trees
"... Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are frequently abstracted as a single rectilinear plane, ignoring via costs, layer dependent routing costs, and congestion impact for routing in a particular direction. In this ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
. In this paper, we consider preferred direction multilayer routing, which more closely models practical applications. We adapt a well known rectilinear planar Steiner tree heuristic, resulting in a new method to construct low cost Steiner trees under a realistic model. Our implementation is fast and effective
A New Heuristic for Rectilinear Steiner Trees
 In Proc. IEEE Int. Conf. on CAD
"... The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NPhard, and much work has been devoted to designing good heuristics and approximation algorithms; to date, the champion in solution quality among RST he ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NPhard, and much work has been devoted to designing good heuristics and approximation algorithms; to date, the champion in solution quality among RST
The Polygonal Contraction Heuristic for Rectilinear Steiner Tree Construction
, 2005
"... Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (RMST) into an RSMT by a novel method called polygonal contraction. Experimental results show that the heuristic matches or e ..."
Abstract
 Add to MetaCart
Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (RMST) into an RSMT by a novel method called polygonal contraction. Experimental results show that the heuristic matches
Efficient Rectilinear Steiner Tree Construction with Rectilinear Blockages
 Proc. ICCD
, 2005
"... Given n points on a plane, a Rectilinear Steiner Minimal Tree (RSMT) connects these points through some extra points called steiner points to achieve a tree with minimal total wire length. Taking blockages into account dramatically increases the problem complexity. It is extremely unlikely that an e ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
that an efficient optimal algorithm exists for Rectilinear Steiner Minimal Tree Construction with Rectilinear Blockages (RSMT RB). Although there exist some heuristic algorithms for this problem, they have either poor quality or expensive running time. In this paper, we propose an efficient and effective approach
A Heuristic Algorithm for the Rectilinear Steiner Arborescence Problem
 Engineering Optimization
, 1994
"... In this paper the following problem is considered: given a root node R in a mesh and a set D of nodes from the mesh, construct a shortestpath tree rooted at R that spans the set D and minimizes the number of links used. The problem is equivalent as finding a Steiner tree in a directed mesh in whic ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
in which all the links point away from the root node R. The problem of finding a Steiner tree in such grid has been known in the literature as the Rectilinear Steiner Arborescence (RSA) problem. Rao et. al [9] have proposed an efficient heuristic algorithm for a special case of this problem, in which all
Highly scalable algorithms for rectilinear and octilinear Steiner trees
 In Proc. Asian and South Pacific Design Automation Conf
, 2003
"... problem, which asks for a minimumlength interconnection of a given set of terminals in the rectilinear plane, is one of the fundamental problems in electronic design automation. Recently there has been renewed interest in this problem due to the need for highly scalable algorithms able to handle ne ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
nets with tens of thousands of terminals. In this paper we give a practical � heuristic for computing nearoptimal rectilinear Steiner trees based on a batched version of the greedy triple contraction algorithm of Zelikovsky [21]. Experiments conducted on both random and industry testcases show
Improved Steiner Tree Approximation in Graphs
, 2000
"... The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialtime heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously bestknown approximation ..."
Abstract

Cited by 225 (6 self)
 Add to MetaCart
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialtime heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously best
Approaching the 5/4Approximation for Rectilinear Steiner Trees
, 1995
"... The rectilinear Steiner tree problem requires a shortest tree spanning a given vertex subset in the plane with rectilinear distance. It was proved that the output length of Zelikovsky's [25] and Berman/Ramaiyer [3] heuristics is at most 1.375 and 97 72 1:347 of the optimal length, respectivel ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
The rectilinear Steiner tree problem requires a shortest tree spanning a given vertex subset in the plane with rectilinear distance. It was proved that the output length of Zelikovsky's [25] and Berman/Ramaiyer [3] heuristics is at most 1.375 and 97 72 1:347 of the optimal length
Optimal Rectilinear Steiner Tree Routing in the Presence of Obstacles
 IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems
, 1993
"... This paper presents a new model for VLSI routing in the presence of obstacles, that transforms any routing instance from a geometric problem into a graph problem. It is the first model that allows computation of optimal obstacleavoiding rectilinear Steiner trees in time corresponding to the instanc ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper presents a new model for VLSI routing in the presence of obstacles, that transforms any routing instance from a geometric problem into a graph problem. It is the first model that allows computation of optimal obstacleavoiding rectilinear Steiner trees in time corresponding
Results 1  10
of
454