Sciweavers

EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
13 years 11 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
EUROCAST
2009
Springer
143views Hardware» more  EUROCAST 2009»
13 years 11 months ago
Effective Bit-Width and Under-Approximation
Robert Brummayer, Armin Biere