74 search results - page 2 / 15 » A Note on Random Minimum Length Spanning Trees |
161
Voted
GECCO
2004
Springer
15 years 11 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...
151
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
154
Voted
COMBINATORICS
2007
15 years 5 months ago
2007
163
Voted
ASPDAC
2001
ACM
15 years 9 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
175
Voted
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...