Results 11  20
of
571,925
Steiner Minimal Trees in Rectilinear and Octilinear Planes
"... Abstract This paper considers the Steiner Minimal Tree (SMT) problem in the rectilinear and octilinear planes. The study is motivated by the physical design of VLSI: The rectilinear case corresponds to the currently used Marchitecture, which uses either horizontal or vertical routing, while the oct ..."
Abstract
 Add to MetaCart
Abstract This paper considers the Steiner Minimal Tree (SMT) problem in the rectilinear and octilinear planes. The study is motivated by the physical design of VLSI: The rectilinear case corresponds to the currently used Marchitecture, which uses either horizontal or vertical routing, while
The Polygonal Contraction Heuristic for Rectilinear Steiner Tree Construction ⋆
"... Abstract — 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 m ..."
Abstract
 Add to MetaCart
Abstract — 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
Rectilinear Steiner Trees with Minimum Elmore Delay
"... We povide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high fidelity estimate of "physical", i.e., SPICEcomputed, signal delay. Previously, however, it was not known how to construct an ..."
Abstract
 Add to MetaCart
We povide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high fidelity estimate of "physical", i.e., SPICEcomputed, signal delay. Previously, however, it was not known how to construct
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
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
Rectilinear Full Steiner Tree Generation
 NETWORKS
, 1997
"... The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a twophase scheme: First a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic p ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a twophase scheme: First a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic
Thumbnail Rectilinear S t einer Trees*
"... The rectilinear Steiner tree problem is to find a manimumlength set of horizontal and vertical line segments that interconnect a given set of points in $he plane. Here we study the thumbnail rectilinear Steiner tree problem, where the inpvt points are drawn from a small integer grid. Specifically, ..."
Abstract
 Add to MetaCart
The rectilinear Steiner tree problem is to find a manimumlength set of horizontal and vertical line segments that interconnect a given set of points in $he plane. Here we study the thumbnail rectilinear Steiner tree problem, where the inpvt points are drawn from a small integer grid. Specifically
An Exact Rectilinear Steiner Tree Algorithm
 In Proceedings of the International Conference on Computer Design
, 1993
"... Given a set of terminals in the plane, a rectilinear Steiner minimal tree is a shortest interconnection among these terminals using only horizontal and vertical edges. We present an algorithm that constructs a rectilinear Steiner minimal tree for an input terminal set. On a workstation, problems inv ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
Given a set of terminals in the plane, a rectilinear Steiner minimal tree is a shortest interconnection among these terminals using only horizontal and vertical edges. We present an algorithm that constructs a rectilinear Steiner minimal tree for an input terminal set. On a workstation, problems
A comparative study of energy minimization methods for Markov random fields
 IN ECCV
, 2006
"... One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with some quantity such as depth or texture. While many such problems can be elegantly expressed in the language of Markov Ran ..."
Abstract

Cited by 412 (36 self)
 Add to MetaCart
the solution quality and running time of several common energy minimization algorithms. We investigate three promising recent methods—graph cuts, LBP, and treereweighted message passing—as well as the wellknown older iterated conditional modes (ICM) algorithm. Our benchmark problems are drawn from published
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
 Journal of the ACM
, 1998
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes ..."
Abstract

Cited by 390 (2 self)
 Add to MetaCart
to Christofides) achieves a 3/2approximation in polynomial time. We also give similar approximation schemes for some other NPhard Euclidean problems: Minimum Steiner Tree, kTSP, and kMST. (The running times of the algorithm for kTSP and kMST involve an additional multiplicative factor k.) The previous best
The Steiner Ratio for ObstacleAvoiding Rectilinear Steiner Trees
"... We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We extend the Steiner ratio to the obstacleavoiding case and show that it is equal to the Steiner ratio for the obstaclefree ..."
Abstract
 Add to MetaCart
We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We extend the Steiner ratio to the obstacleavoiding case and show that it is equal to the Steiner ratio for the obstacle
Results 11  20
of
571,925