Results 1  10
of
20,174
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
When Is "Nearest Neighbor" Meaningful?
 In Int. Conf. on Database Theory
, 1999
"... . We explore the effect of dimensionality on the "nearest neighbor " problem. We show that under a broad set of conditions (much broader than independent and identically distributed dimensions), as dimensionality increases, the distance to the nearest data point approaches the distance ..."
Abstract

Cited by 402 (1 self)
 Add to MetaCart
. We explore the effect of dimensionality on the "nearest neighbor " problem. We show that under a broad set of conditions (much broader than independent and identically distributed dimensions), as dimensionality increases, the distance to the nearest data point approaches
On the Construction of EnergyEfficient Broadcast and Multicast Trees in Wireless Networks
, 2000
"... wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil ..."
Abstract

Cited by 554 (13 self)
 Add to MetaCart
wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
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
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
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
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 26 (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
On constructing minimum spanning trees in kdimensional space and related problems
 SIAM JOURNAL ON COMPUTING
, 1982
"... . The problem of finding a minimum spanning tree connecting n points in a kdimensional space is discussed under three common distance metrics: Euclidean, rectilinear, and L. By employing a subroutine that solves the post office problem, we show that, for fixed k _> 3, such a minimum spanning t ..."
Abstract

Cited by 235 (1 self)
 Add to MetaCart
. The problem of finding a minimum spanning tree connecting n points in a kdimensional space is discussed under three common distance metrics: Euclidean, rectilinear, and L. By employing a subroutine that solves the post office problem, we show that, for fixed k _> 3, such a minimum spanning
MEGA5: Molecular evolutionary genetics analysis using maximum . . .
, 2011
"... Comparative analysis of molecular sequence data is essential for reconstructing the evolutionary histories of species and inferring the nature and extent of selective forces shaping the evolution of genes and species. Here, we announce the release of Molecular Evolutionary Genetics Analysis version ..."
Abstract

Cited by 6858 (19 self)
 Add to MetaCart
5 (MEGA5), which is a userfriendly software for mining online databases, building sequence alignments and phylogenetic trees, and using methods of evolutionary bioinformatics in basic biology, biomedicine, and evolution. The newest addition in MEGA5 is a collection of maximum likelihood (ML
Results 1  10
of
20,174