Sciweavers

    WEA
    2007
    Springer
    158views Algorithms» more  WEA 2007»
    A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
    13 years 10 months ago
    A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
    Download  www.mpi-inf.mpg.de
    The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
    Markus Behle, Michael Jünger, Frauke Liers
    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-2024, USA.