Provably good routing tree construction with multi-port terminals
Proceedings of the 1997 international symposium on Physical design
IEEE Transactions on Computers
Improved approximation bounds for the group Steiner problem
Proceedings of the conference on Design, automation and test in Europe
On the full and bottleneck full Steiner tree problems
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
An improved approximation algorithm for the terminal Steiner tree problem
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Contraction-based steiner tree approximations in practice
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.90 |