74 search results - page 2 / 15 » The Lower Tail of the Random Minimum Spanning Tree |
SIAMCOMP
2000
13 years 5 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
IPL
2007
13 years 5 months ago
2007
TALG
2008
13 years 5 months ago
2008
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...