Sciweavers

    GECCO
    2009
    Springer
    143views Optimization» more  GECCO 2009»
    Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
    14 years 8 months ago
    Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
    Download  www.ads.tuwien.ac.at
    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
    claim paper
    Read More »
    EUROCAST
    2009
    Springer
    185views Hardware» more  EUROCAST 2009»
    Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
    14 years 8 months ago
    Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
    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 »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.