位置：成果数据库 > 会议 > 会议详情页
A 3-Step Heuristic for Obstacl
  • 所属机构名称：清华大学
  • 成果类型：会议
  • 相关项目：基于3、4-几何结构的互连算法研究
作者： Yu Hu, Zhe Feng, Tong Jing*, X
同会议论文项目
基于3、4-几何结构的互连算法研究
期刊论文 22 会议论文 35
同项目会议论文
DraXRouter: Global Routing in
The Polygonal Contraction Heur
XML-Based Middle Data Denotati
Minimum data aggregation probl
Obstacle-Avoiding Rectilinear
An improved approximation algo
Energy efficient geographic an
The Structural Properties of H
A Practical and Efficient Inte
Efficient Octilinear Steiner T
CDCTree: Novel Obstacle-Avoidi
Connected set cover problem an
The Polygonal Contraction Heur
An O(nlogn) Algorithm for Obst
Wavelength assignment for sati
FREe: A Fast Routability Estim
An Efficient Rectilinear Stein
A Min-Max relation on packing
Rotational Steiner ratio probl
Minimum multicast time problem
A Routing Paradigm with Novel
Multicast routing and waveleng
Via-Aware Global Routing for G
Timing-Driven Global Routing w
Energy efficient multicast rou
Optimal data replica placement
A Coupling and Crosstalk Consi
An-OARSMan: Obstacle-Avoiding
Average Lengths of Wire Routin
A Min-area Solution to Perform
Obstacle-Avoiding Rectilinear
Power/Ground Network Aware and
Complexity of minimal tree rou
Energy efficient protocols for