Sciweavers

Share
40 search results - page 1 / 8
» Preferred direction Steiner trees
Sort
View
TCAD
2002
128views more  TCAD 2002»
10 years 2 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
GLVLSI
2003
IEEE
177views VLSI» more  GLVLSI 2003»
10 years 8 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
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
10 years 4 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...
JISE
2006
107views more  JISE 2006»
10 years 2 months ago
FasterDSP: A Faster Approximation Algorithm for Directed Steiner Tree Problem
Ming-I Hsieh, Eric Hsiao-Kuang Wu, Meng-Feng Tsai
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
10 years 7 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
books