5 search results - page 1 / 1 » Canonical Forms and Algorithms for Steiner Trees in Uniform ... |
ALGORITHMICA
2006
13 years 4 months ago
2006
We present some fundamental structural properties for minimum length networks (known as Steiner minimum trees) interconnecting a given set of points in an environment in which edg...
WADS
2007
Springer
13 years 10 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...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
ALGOSENSORS
2009
Springer
13 years 2 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
GLVLSI
2003
IEEE
13 years 10 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...