Sciweavers

411 search results - page 12 / 83
» A New Approach to the Rectilinear Steiner Tree Problem
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
VLSID
2002
IEEE
92views VLSI» more  VLSID 2002»
15 years 10 months ago
Electromigration Avoidance in Analog Circuits: Two Methodologies for Current-Driven Routing
Interconnect with an insufficient width may be subject to electromigration and eventually cause the failure of the circuit at any time during its lifetime. This problem has gotten...
Jens Lienig, Goeran Jerke, Thorsten Adler
ISPD
2003
ACM
88views Hardware» more  ISPD 2003»
15 years 2 months ago
Porosity aware buffered steiner tree construction
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
Charles J. Alpert, Gopal Gandham, Milos Hrkic, Jia...
92
Voted
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 4 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
ICCAD
1995
IEEE
140views Hardware» more  ICCAD 1995»
15 years 1 months ago
Bounded-skew clock and Steiner routing under Elmore delay
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
Jason Cong, Andrew B. Kahng, Cheng-Kok Koh, Chung-...