35 search results - page 2 / 7 » When crossings count - approximating the minimum spanning tr... |
WEA
2010
Springer
14 years 4 days ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
GECCO
2009
Springer
13 years 12 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
COR
2008
13 years 4 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...