Sciweavers

20 search results - page 2 / 4
» Integrality ratio for group Steiner trees and directed stein...
Sort
View
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
11 years 8 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 7 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
GLVLSI
2003
IEEE
177views VLSI» more  GLVLSI 2003»
13 years 11 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
ICCAD
2006
IEEE
119views Hardware» more  ICCAD 2006»
14 years 2 months ago
FastRoute: a step to integrate global routing into placement
Because of the increasing dominance of interconnect issues in advanced IC technology, placement has become a critical step in the IC design flow. To get accurate interconnect inf...
Min Pan, Chris C. N. Chu
DAC
2006
ACM
14 years 6 months ago
Optimal jumper insertion for antenna avoidance under ratio upper-bound
Antenna effect may damage gate oxides during plasma-based fabrication process. The antenna ratio of total exposed antenna area to total gate oxide area is directly related to the ...
Jia Wang, Hai Zhou