Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
51
click to vote
EUROCAST
2009
Springer
185
views
Hardware
»
more
EUROCAST 2009
»
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
14 years 9 months ago
Download
www.ads.tuwien.ac.at
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
claim paper
Read More »
33
click to vote
EUROCAST
2009
Springer
143
views
Hardware
»
more
EUROCAST 2009
»
Effective Bit-Width and Under-Approximation
14 years 9 months ago
Download
fmv.jku.at
Robert Brummayer, Armin Biere
claim paper
Read More »
« first
‹ previous
1
2