31 search results - page 1 / 7 » Solving the Minimum Label Spanning Tree Problem by Ant Colon... |
GEM
2010
13 years 4 months ago
2010
PPSN
2010
Springer
13 years 4 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 ...
JISE
2008
13 years 6 months ago
2008
GECCO
2006
Springer
13 years 10 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...
EVOW
2010
Springer
13 years 10 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...