[PDF][PDF] Improved steiner tree approximation in graphs.
G Robins, A Zelikovsky - SODA, 2000 - researchgate.net
Improved Steiner Tree Approximation in Graphs 1 Introduction Page 1 Improved Steiner Tree
Approximation in Graphs Gabriel Robins Alexander Zelikovskyy Abstract The Steiner tree …
Approximation in Graphs Gabriel Robins Alexander Zelikovskyy Abstract The Steiner tree …
Tighter bounds for graph Steiner tree approximation
G Robins, A Zelikovsky - SIAM Journal on Discrete Mathematics, 2005 - SIAM
The classical Steiner tree problem in weighted graphs seeks a minimum weight connected
subgraph containing a given subset of the vertices (terminals). We present a new polynomial …
subgraph containing a given subset of the vertices (terminals). We present a new polynomial …
FLUTE: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design
C Chu, YC Wong - … Transactions on Computer-Aided Design of …, 2007 - ieeexplore.ieee.org
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)
algorithm called fast lookup table estimation (FLUTE). FLUTE is based on a precomputed …
algorithm called fast lookup table estimation (FLUTE). FLUTE is based on a precomputed …
On wirelength estimations for row-based placement
Wirelength estimation in VLSI layout is fundamental to any pre-detailed routing estimate of
timing or routability. In this paper, we develop new wirelength estimation techniques …
timing or routability. In this paper, we develop new wirelength estimation techniques …
[PDF][PDF] New performance-driven FPGA routing algorithms
MJ Alexander, G Robins - Proceedings of the 32nd annual ACM/IEEE …, 1995 - dl.acm.org
Motivated by the goal of increasing the performance of FPGA-based designs, we propose e
ective Steiner and arborescence FPGA routing algorithms. Our graphbased Steiner tree …
ective Steiner and arborescence FPGA routing algorithms. Our graphbased Steiner tree …
FLUTE: Fast lookup table based wirelength estimation technique
C Chu - IEEE/ACM International Conference on Computer …, 2004 - ieeexplore.ieee.org
Wirelength estimation is an important tool to guide the design optimization process in early
design stages. In this paper, we present a wirelength estimation technique called FLUTE …
design stages. In this paper, we present a wirelength estimation technique called FLUTE …
Software defined multicast for large-scale multi-layer leo satellite networks
The emerging large-scale low earth orbit (LEO) broadband satellite networks manifest great
potentials in distributing videos across the globe via efficient multicast techniques. However …
potentials in distributing videos across the globe via efficient multicast techniques. However …
[HTML][HTML] Optimization of multiple PON deployment costs and comparison between GPON, XGPON, NGPON2 and UDWDM PON
In this paper we propose an optimization framework for multiple deployment of PON in a
wide region with very large number of users, with different bit rate demands, serviced by …
wide region with very large number of users, with different bit rate demands, serviced by …
Efficient Steiner tree construction based on spanning graphs
H Zhou - Proceedings of the 2003 international symposium on …, 2003 - dl.acm.org
Steiner Minimal Tree (SMT) problem is a very important problem in VLSI CAD. Given n
points on a plane, a Steiner minimal tree connects these points through some extra points …
points on a plane, a Steiner minimal tree connects these points through some extra points …
Prim-Dijkstra revisited: Achieving superior timing-driven routing trees
The Prim-Dijkstra (PD) construction [1] was first presented over 20 years ago as a way to
efficiently trade off between shortest-path and minimum-wirelength routing trees. This …
efficiently trade off between shortest-path and minimum-wirelength routing trees. This …