New approximation algorithms for routing with multiport terminals | 2 | 0.42 | 2000 |
New and exact filling algorithms for layout density control | 14 | 1.83 | 1999 |
Filling algorithms and analyses for layout density control | 39 | 8.97 | 1999 |
Improved approximation bounds for the group Steiner problem | 4 | 0.72 | 1998 |
Dynamically-wiresized Elmore-based routing constructions | 8 | 2.56 | 1994 |
Fidelity and Near-Optimality of Elmore-Based Routing Constructions | 49 | 4.03 | 1993 |
Minimum Density Interconnection Trees | 1 | 0.42 | 1993 |
A new class of iterative Steiner tree heuristics with good performance | 65 | 8.71 | 1992 |
On the performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension | 3 | 0.51 | 1992 |