31 search results - page 1 / 7 » Solving the Minimum Label Spanning Tree Problem by Ant Colon... |
93
Voted
GEM
2010
14 years 11 months ago
2010
126
Voted
PPSN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
84
Voted
JISE
2008
15 years 1 months ago
2008
119
Voted
GECCO
2006
Springer
15 years 4 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...
107
Voted
EVOW
2010
Springer
15 years 5 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...