130 search results - page 1 / 26 » Faster Approximation Algorithms for the Rectilinear Steiner ... |
ISAAC
1993
Springer
14 years 3 months ago
1993
Springer
ICCAD
1999
IEEE
14 years 3 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
JISE
2006
13 years 11 months ago
2006
WADS
2007
Springer
14 years 5 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
SODA
2004
ACM
14 years 9 days ago
2004
ACM
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...