Sciweavers

21 search results - page 1 / 5
» Constraint Programming for the Diameter Constrained Minimum ...
Sort
View
ENDM
2008
85views more  ENDM 2008»
13 years 5 months ago
Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
Thiago F. Noronha, Andréa C. Santos, Celso ...
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 9 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
13 years 12 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
13 years 10 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
13 years 12 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
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. ...
Martin Gruber, Günther R. Raidl