66 search results - page 10 / 14 » On the Length of a Random Minimum Spanning Tree |
STOC
2010
ACM
13 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
MOBIHOC
2007
ACM
14 years 6 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
ALGORITHMICA
2002
13 years 6 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
GLVLSI
2003
IEEE
14 years 4 hour 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...
ISPD
2005
ACM
14 years 8 days ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...