326 search results - page 9 / 66 » The Minimum-Area Spanning Tree Problem |
136
Voted
EVOW
2007
Springer
15 years 9 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...
140
Voted
GECCO
2006
Springer
15 years 7 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...
122
click to vote
GECCO
2006
Springer
15 years 7 months 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...
162
Voted
EUROCAST
2009
Springer
15 years 10 months ago
2009
Springer
114
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE