60 search results - page 6 / 12 » A fast algorithm for computing minimum routing cost spanning... |
159
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
128
click to vote
FPGA
2003
ACM
15 years 9 months ago
2003
ACM
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
144
click to vote
ISPD
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
154
click to vote
DAC
1989
ACM
15 years 8 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
145
click to vote
WINET
2010
15 years 2 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...