277 search results - page 21 / 56 » The saga of minimum spanning trees |
IJKESDP
2010
14 years 8 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
104
click to vote
JUCS
2007
14 years 10 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
100
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
JPDC
2006
14 years 10 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...