326 search results - page 9 / 66 » The Minimum-Area Spanning Tree Problem |
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
GECCO
2006
Springer
14 years 6 days 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...
GECCO
2006
Springer
14 years 6 days ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
EUROCAST
2009
Springer
14 years 3 months ago
2009
Springer
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE