Sciweavers

Share
ICCAD
2010
IEEE
229views Hardware» more  ICCAD 2010»
8 years 3 months ago
Obstacle-avoiding rectilinear Steiner minimum tree construction: An optimal approach
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
Tao Huang, Evangeline F. Y. Young
TCAD
2002
128views more  TCAD 2002»
8 years 5 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
8 years 6 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
DAC
1994
ACM
8 years 9 months ago
Rectilinear Steiner Trees with Minimum Elmore Delay
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCo...
ICCAD
1997
IEEE
91views Hardware» more  ICCAD 1997»
8 years 9 months ago
Interconnect layout optimization under higher-order RLC model
In this paper, we study the interconnect layout optimization problem under a higher-order RLC model to optimize not just delay, but also waveform for RLC circuits with non-monoton...
Jason Cong, Cheng-Kok Koh
AIMS
2010
Springer
8 years 10 months ago
Automatic Link Numbering and Source Routed Multicast
We present a new paradigm for multicasting. Our paradigm combines two ideas: a simple distributed algorithm for automatically numbering network links with a small amount of numbers...
Visa Holopainen, Raimo Kantola, Taneli Taira, Olli...
GLVLSI
2003
IEEE
177views VLSI» more  GLVLSI 2003»
8 years 10 months ago
Congestion reduction in traditional and new routing architectures
In dense integrated circuit designs, management of routing congestion is essential; an over congested design may be unroutable. Many factors influence congestion: placement, rout...
Ameya R. Agnihotri, Patrick H. Madden
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
8 years 10 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
ADHOCNOW
2005
Springer
8 years 11 months ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
ISCC
2005
IEEE
143views Communications» more  ISCC 2005»
8 years 11 months ago
Approximating Optimal Multicast Trees in Wireless Multihop Networks
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
books